#include <bits/stdc++.h>

using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
const int nmax = 1e5+4;

int n, m, rmq[18][nmax], lg2[nmax];

int main()
{
    fin>>n>>m;

    for(int i = 2; i <= n; ++i)
        lg2[i] = lg2[i/2] + 1;

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

    for(int p = 1; p <= 17; ++p)
    {
        for(int i = 1; i <= n; ++i)
        {
            rmq[p][i] = rmq[p-1][i];
            int j = (1<<(p-1));
            if(i + j <= n)
            {
                rmq[p][i] = min(rmq[p][i], rmq[p-1][i+j]);
            }
        }
    }
    while(m--)
    {
        int st, dr;
        fin>>st>>dr;
        if(st > dr)
            swap(st, dr);

        int p = lg2[dr - st + 1], ans;
        ans = min(rmq[p][st], rmq[p][dr - (1<<p) + 1]);
        fout<<ans<<"\n";
    }


    return 0;
}