#include <bits/stdc++.h>

using namespace std;

long int n,m;

long int rmq[18][100005];
long int lg[100005];



int main()
{
    freopen("rmq.in" , "r", stdin);
    freopen("rmq.out", "w", stdout);


    scanf("%ld %ld",&n,&m);

    for(long int i=1;i<=n;++i){
        scanf("%ld ",&rmq[0][i]);
    }

    for(long int i=2;i<=n;++i)
        lg[i] = lg[i/2]+1;
    long int k;
    for(long int i=1; (1<<i) <= n;++i ){
        k = 1<<(i-1);
        for(long int j=1;j <= n - (1<<i)+1 ;++j){
            rmq[i][j] = min( rmq[i-1][j] , rmq[i-1][j+ k ] );
        }
    }
    long int x,y , dif, sh,l;

    for(long int i=1;i<=m;++i){
        scanf("%ld %ld",&x,&y);
        dif = y-x+1;
        l = lg[dif];
        sh = dif- (1<<l);
        printf("%ld\n", min(rmq[l][x] , rmq[l][x+sh]) );

    }


    return 0;
}