#include <bits/stdc++.h>

using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int d[100005][21],m,x,y,n,i,j;
int main()
{
    fin>>n>>m;
    memset(d,0x8f,sizeof(d));
    for(i=1;i<=n;i++)
    {
        fin>>d[i][0];
    }
    for(j=1;(1<<j)<=n;j++)
    {
        for(i=1;i+(1<<j)-1<=n;i++)
        {
            d[i][j]=min(d[i][j-1],d[i+(1<<(j-1))][j-1]);
        }
    }
    while(m--)
    {
        fin>>x>>y;
        int p=log(y-x+1);
        fout<<min(d[x][p],d[y-(1<<p)+1][p])<<'\n';
    }
    return 0;
}