#include <bits/stdc++.h>

using namespace std;

int d[100010][20];
int n,m,x,y,i,j,ceva;

int main()
{
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
    scanf("%d%d",&n,&m);
    for (i=1;i<=n;i++) {scanf("%d",&d[i][0]);}
    for (j=1;(1<<j)<=n;j++){
        for (i=1;i+(1<<j)-1<=n;i++){
            d[i][j]=min(d[i][j-1],d[i+(1<<(j-1))][j-1]);
        }
    }
    for (i=1;i<=m;i++){
        scanf("%d%d",&x,&y);
        ceva=log2(y-x+1);
        printf("%d\n",min(d[x][ceva],d[y-(1<<ceva)+1][ceva]));
    }
    return 0;
}