#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
#define MAX 100001

int b[MAX][18],n;

void rmq(){
    for(int j=1;(1<<j)<=n;j++)
    for(int i=0;i+(1<<j)<=n;i++) b[i][j] = min( b[i][j-1], b[i+(1<<(j-1))][j-1] );
}

int main(){
    int m,x,y,k;
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
        scanf("%d %d",&n,&m);
        for(int i=0;i<n;i++) scanf("%d",&b[i][0]);

    rmq();

        while(m--)
        {
            scanf("%d %d",&x,&y);
            k = log(y-x+1)/log(2);
            printf("%d\n",min( b[x-1][k], b[y-(1<<k)][k] ));
        }
    return 0;
}