#include <bits/stdc++.h>

using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n,m,i,y,x,dist;
int rmq[100005][1005];
int p2[1004];
void rmqq()
{
    for(int j=1; (1<<j)<=n; j++)
    {
        for(int i=1; i+(1<<j)-1<=n; i++)
        {
            rmq[i][j]=min(rmq[i][j-1],rmq[i+(1<<(j-1))][j-1]);

        }
    }
}
int main()
{
    fin>>n>>m;
    for(i=1; i<=n; i++)
    {
        fin>>rmq[i][0];
    }
    rmqq();
      for (i=2;i<=n;i++) p2[i]=p2[i/2]+1;

    for(i=1; i<=m; i++)
    {
        fin>>x>>y;
        dist=y-x+1;
        dist=p2[dist];
        fout<<min(rmq[x][dist],rmq[y+1-(1<<dist)][dist])<<'\n';

    }
    return 0;
}