#include<vector>
#include<fstream>

using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int p[100010],d[18][100010], v[100010];
int i, n, m, t, a, b,l;


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

    for(t=1;t<=p[n];t++)
    {
        for(i=1;i<=n;i++)
        {
            d[t][i] = d[t-1][i];
            if (i+(1<<(t-1)) <= n)
                d[t][i]=min(d[t][i], d[t-1][i+(1<<(t-1))]);
        }

    }
    for(i=1;i<=m;i++)
    {
        fin>>a>>b;l=p[b-a+1];
        fout<<min(d[l][a], d[l][b-(1<<l)+1])<<"\n";
    }
    fin.close();
    fout.close();
    return 0;
}