#include <fstream>

using namespace std;

ifstream fin("rmq.in");
ofstream fout("rmq.out");
const int Pmax = 18, Nmax = 100001;
int r[Pmax][Nmax];
int vpow[Nmax];

int main()
{
    int n, q, i;

    fin >> n >> q;

    for(i = 1; i <= n; i++)
        fin >> r[0][i];


    vpow[1] = 0;
    for(i = 2; i <= Nmax; i++)
        vpow[i] = vpow[i / 2] + 1;

    int p;
    for(p = 1; p <= vpow[n]; p++)
    {
        for(i = 1; i <= n; i++)
        {
            r[p][i] = r[p - 1][i];
            int next = r[p - 1][i + (1 << (p - 1))];
            if(i + (1 << (p - 1)) <= n && next < r[p][i])
                r[p][i] = next;
        }
    }

    for(i = 1; i <= q; i++)
    {
        int st, dr;
        fin >> st >> dr;
        fout << min(r[vpow[dr - st + 1]][st], r[vpow[dr - st + 1]][dr - vpow[dr - st + 1]]) << '\n';
    }



    return 0;
}