#include <bits/stdc++.h>

using namespace std;

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

int n, m;
int v[100005];
int rmq[20][100005];
int lg2[100005];

int main()
{
    fin.tie(0); fin.sync_with_stdio(false);
    fin>>n>>m;
    lg2[1]=0;
    for (int i=2; i<=n; i++) lg2[i]=lg2[i/2]+1;
    for (int i=1; i<=n; i++) fin>>v[i];
    for (int i=1; i<=n; i++) {
        rmq[0][i]=v[i];
        //cout<<rmq[0][i]<<' ';
    }
    //cout<<'\n';
    for (int i=1; (1<<i)<=n; i++) {
        for (int j=1; j<=(n-(1<<i)+1); j++) {
            rmq[i][j] = min(rmq[i-1][j], rmq[i-1][j+(1<<(i-1))]);
            //cout<<rmq[i][j]<<' ';
        }
        //cout<<'\n';
    }
    for (int i=1; i<=m; i++) {
        int x, y; fin>>x>>y;
        int len = y - x;
        //cout<<len<<" - "<<lg2[len]<<" "<<rmq[lg2[len]][x]<<" "<<rmq[lg2[len]][y-len+1]<<endl;
        fout<<min(rmq[lg2[len]][x], rmq[lg2[len]][y-len+1])<<'\n';
    }
    return 0;
}