#include <iostream>
#include <fstream>
using namespace std;

int n, m, i, j, v[100002], ma[20][100002], q, a, b, l, mi, k, p2;

int main()
{
    ifstream fin ("rmq.in");
    ofstream fout ("rmq.out");
    fin >> n >> m;
    for(i = 1; i <= n; i++)
        fin >> v[i];
    for(i = 0; (1 << i) <= n; i++)
    {
        for(j = 1; j <= n - (1 << i) + 1; j++)
        {
            if(i > 0)
                ma[i][j] = min(ma[i - 1][j], ma[i - 1][j + (1 << i - 1)]);
            else
                ma[i][j] = v[j];
            //cout << ma[i][j] << " ";
        }
        //cout << "\n";
    }
    for(q = 1; q <= m; q++)
    {
        fin >> a >> b;
        l = b - a + 1;
        k = 0; p2 = 1;
        while(p2 <= l)
        {
            k++;
            p2 *= 2;
        }
        k--;
        p2 /= 2;
        /*out << k << " " << a << "\n";
        fout << ma[k][a] << " " << ma[k][a + l - p2] << "\n";*/
        fout << min(ma[k][a], ma[k][a + l - p2]) << "\n";
    }
    return 0;
}