#include <iomanip>
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("rmq.in");
ofstream fout("rmq.out");

// rmq[x][y] - Minimul element din subsecventa cu (2^x) elemente care incepe in y
int rmq[17][100001], n, m;

int exp[100001]; // floor(log2(x))

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

    for (int x=2,p=1; x<n; ++p, x<<=1)
    {
        for (int i=1; i<=n; i++)
        {
            rmq[p][i] = rmq[p-1][i];
            int i2 = i+x/2;
            if (i2 <= n && rmq[p][i] > rmq[p-1][i+x/2])
                rmq[p][i] = rmq[p-1][i+x/2];
        }
    }

    for (;m;m--)
    {
        int a,b;
        fin >> a >> b;

        // query
        int e = exp[b-a+1];
        int len = (1 << e);

        // minimul dintre intervalul
        // [st, st+len], si [dr-len+1, dr]
        // deoarece len = 2^[log_2(dr-st+1)],
        // intervalele se suprapun sau sunt vecine

        fout << min(rmq[e][a], rmq[e][b-len+1]) << endl;
    }


    return 0;
}