#include <bits/stdc++.h>

using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n, q, rmq[17][100010], expo[100010];

int main()
{
    fin >> n >> q;
    for(int i=1; i<=n; i++) fin >> rmq[0][i];
    for(int p=1; (1 << p)<=n; p++) {
        for(int i=1; i<=n; i++) {
            rmq[p][i] = rmq[p - 1][i];
            int j = i + (1 << (p - 1));
            if(j <= n && rmq[p - 1][j] < rmq[p][i]) rmq[p][i] = rmq[p - 1][j];
        }
    }
    expo[1] = 0;
    for(int i=2; i<=n; i++) expo[i] = expo[i / 2] + 1;
    while(q--) {
        int st, dr; fin >> st >> dr;
        int putere = expo[dr - st + 1];
        int lung = (1 << putere);
        fout << min(rmq[putere][st], rmq[putere][dr - lung + 1]) << '\n';
    }

    return 0;
}