#include<iostream>
#include<fstream>
using namespace std;
int ni,n,i=0,j,m[17][100001]= {0};

int main()
{
    ifstream f("rmq.in");
    ofstream g("rmq.out");
    f>>n>>ni;
    long int p2[18]= {1,2,4,8,16,32,64,128,256,512,1024,2048,4096,8192,16384,32768,65536,121000};
    for(i=1; i<=n; i++)
        f>>m[0][i];
    for(i=1; i<17; i++)
        for(j=1; j<n-i+1; j++)
            if(m[i-1][j]<=m[i-1][j+p2[i-1]])m[i][j]=m[i-1][j];
            else m[i][j]=m[i-1][j+p2[i-1]];
    //for(i=0;i<=17;i++){for(j=1;j<=n-i;j++)cout<<m[i][j]<<" ";cout<<'\n';}
    int k=0,x,y;
    for(int t=1; t<=ni; t++)
    {
        f>>x>>y;
        k=0;
        while(p2[k]<=y-x+1)k++;
        --k;
        g<<min(m[k][x],m[k][y+1-p2[k]])<<'\n';

    }
}

/*
#include<cstdio>
#include<iostream>
using namespace std;
int x,y,diff,sh,i,j,l,n,m,lg[100002],rmq[18][100002];
int main()
{
    //freopen("rmq.in","r",stdin);
    //freopen("rmq.out","w",stdout);
    //cout<<"2d2";
    scanf("%d %d",&n,&m);
    for (i=1;i<=n;i++)
        scanf("%d ",&rmq[0][i]);
    lg[1]=0;
    for (i=2;i<=100;i++)
        {lg[i]=lg[i/2]+1;printf("%d --> %d\n",i,lg[i]);}
    for (i=1;(1<<i)<=n;i++)
        for (j=1;j<=n-(1 << i)+1;j++)
        {
        l=1<<(i-1);
        rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+l]);
        }
    for (i=1;i<=m;i++)
    {
        scanf("%d %d",&x,&y);
        diff=y-x+1;
        l=lg[diff];
        sh=diff - (1<<l);
        printf("%d\n",min(rmq[l][x],rmq[l][x+sh]));
    }
    return 0;
}
*/