#include <bits/stdc++.h>

using namespace std;

ifstream fin("rmq.in");
ofstream fout("rmq.out");

const int NMAX=1e6+5;
const int GMAX=105;

int n, m, rmq[GMAX][NMAX], lg[NMAX], x, y, k, a;

int query(int x, int y)
{
    k=lg[y-x];
    return min(rmq[k][x],rmq[k][y-(1<<(k))+1]);
}

int main()
{
    fin>>n>>m;

    for(int i=1;i<=n;++i) {fin>>a; rmq[0][i]=a;}

    lg[1]=0;

    for(int i=2;i<=lg[n];++i)

        for(int j=1;j<=n;++i)

          rmq[i][j]=min(rmq[i-1][j], rmq[i-1][j+(1<<(i-1))]);

    for(int i=1;i<=m;++i)
    {
        fin>>x>>y;
        fout<<query(x,y)<<'\n';
    }


    return 0;
}