#include <bits/stdc++.h>

using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n,k,a,b,t,l,d[17][100001],p[100001];
int main()
{
    fin >> n >> k;
    for (int i=1; i<=n; i++)
        fin >> d[0][i];
    p[1] = 0;
    for (int i=2; i<=n; i++)
        p[i] = p[i/2]+1;
    for (int i=1; i<=p[n]; i++)
        for (int j=1; j<=n; j++)
        {
            d[i][j] = d[i-1][j];
            if (j+(1<<(i-1)) <= n)
                d[i][j] = min(d[i][j], d[i-1][j+(1<<(i-1))]);
        }
    for (int i=1; i<=k; i++)
    {
        fin >> a >> b;
        l = p[b-a+1];
        fout << min(d[l][a], d[l][b-(1<<l)+1]) << "\n";
    }
    return 0;
}