#include <fstream>
#define nmax (int)(1e5+1)
using namespace std;
ifstream cin("rmq.in");
ofstream cout("rmq.out");
int n,q,x,y,rmq[18][nmax],p[nmax];
int query(int x,int y){
    int e=p[y-x+1];
    return min(rmq[e][x],rmq[e][y-(1<<e)+1]);
}
int main()
{
    cin>>n>>q;
    for(int i=1;i<=n;i++)
        cin>>rmq[0][i];
    for(int i=2;i<=n;i++)
        p[i]=p[i/2]+1;
    for(int i=1;(1<<i)<=n;i++)
        for(int j=1;j+(1<<(i-1))<=n;j++)
            rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+(1<<(i-1))]);
    while(q--){
        cin>>x>>y;
        cout<<query(x,y)<<'\n';
    }
    return 0;
}