#include <bits/stdc++.h>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int logg[100005], v[100005], RMQ[100005][22];
int main()
{
    int q, n, a, b;
    fin>>n>>q;
    for(int i=1; i<=n; i++)
    {
        fin>>v[i];
        RMQ[i][0]=v[i];
    }
    for(int i=2; i<=n; i++)
        logg[i]=logg[i/2]+1;
    for(int i=1; i<=logg[n]; i++)
    {
        for(int j=1; j<=n; j++)
        {
            if(j+(1<<(i-1))>n)
                break;
            RMQ[j][i]=min(RMQ[j][i-1],RMQ[j+(1<<(i-1))][i-1]);
        }
    }
    while(q--)
    {
        fin>>a>>b;
        fout<<min(RMQ[a][logg[b-a+1]],RMQ[b+1-(1<<(logg[b-a+1]))][logg[b-a+1]])<<'\n';
    }
    return 0;
}