#include<cstdio>
#include<vector>
using namespace std;int ni,n,i=0,j,m[17][100001]= {0};char buff[2900000];
int pos;
FILE*f=freopen("rmq.in","r",stdin);
FILE*g=freopen("rmq.out","w",stdout);
inline void read(int &nr)
{
    while(buff[pos] < '0' || buff[pos] > '9') if(++pos == 290000) fread(buff, 1, 290000, stdin), pos = 0;
    nr = 0;
    while('0' <= buff[pos] && buff[pos] <= '9')
    {
        nr = nr * 10 + buff[pos] - '0';
        if(++pos == 290000) fread(buff, 1, 290000, stdin), pos = 0;
    }
}


int main()
{
    fread(buff, 1, 290000, stdin);
    read(n);
    read(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++)
        read(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]];
    int k=0,x,y;
    for(int t=1; t<=ni; t++)
    {
        read(x);
        read(y);
        k=0;
        while(p2[k]<=y-x+1)k++;
        --k;
        printf("%d\n",min(m[k][x],m[k][y+1-p2[k]]));

    }
}