#include <bits/stdc++.h>

using namespace std;

int lg2[100005], n, pd[20][100005], v[100005], test;

int main()
{
    ifstream fin ("rmq.in");
    ofstream fout ("rmq.out");
    lg2[2] = 1;
    for (int i = 3; i <= 100000; ++i)
        lg2[i] = lg2[i/2]+1;
    fin >> n >> test;
    for (int i = 1; i <= n; ++i)
        fin >> v[i];
    for (int i = 1; i < n; ++i)
        pd[0][i] = min(v[i], v[i+1]);
    for (int t = 1; t <= lg2[n-1]; ++t)
        for (int i = 1; i <= n-(1<<t); ++i)
            pd[t][i] = min(pd[t-1][i], pd[t-1][i+(1<<(t-1))]);
    while(test--){
        int x, y, sz;
        fin >> x >> y;
        fout << min(pd[sz][x], pd[sz][y-(1<<sz)]) << "\n";
    }
    fin.close();
    fout.close();
    return 0;
}