#include <bits/stdc++.h>

using namespace std;
int n,m,x,y;
int rmq[17][100005];
static void prec_rmq(){
for(int j=1;(1<<j)<=n;++j)
    for(int i=1;i<=n;++i)
        rmq[j][i]=min(rmq[j-1][i],rmq[j-1][i+(1<<(j-1))]);
}
inline int nl(int n){
return 31-__builtin_clz(n);
}
int main()
{
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
    scanf("%d %d ",&n,&m);
    for(int i=1;i<=n;++i)
        scanf("%d ",&rmq[0][i]);
    prec_rmq();
    while(m--){
        scanf("%d %d ",&x,&y);
        int logg=nl(y-x+1);
        printf("%d\n",min(rmq[logg][x],rmq[logg][y-(1<<logg)+1]));
    }
}