#include <bits/stdc++.h>

using namespace std;

#define NMAX 100002
#define LMAX 18

int rmq[LMAX][NMAX], n, m, lg[NMAX], a[NMAX];
void afisare (int x) {
    for (int i = 0; i <= x; ++i) {
            for (int j = 1; j <= n; ++j)
            cout << rmq[i][j] << " ";
    cout << "\n";
}
cout << "\n\n";
}

int main()
{
    ifstream f("rmq.in");
    ofstream g("rmq.out");
    int i, j, l;
    f >> n >> m;
    for (i = 1; i <= n; ++i)
        f >> a[i];
    lg[1] = 0;
    for (i = 2; i <= n; ++i)
        lg[i] = lg[i / 2] + 1;
    for (i = 1; i <= n; ++i)
        rmq[0][i] = a[i];

    for (i = 1; (1 << i) <= n; ++i)
        for (j = 1; j <= n - (1 << i) + 1; ++j) {
        rmq[i][j] = min (rmq[i-1][j], rmq[i-1][j+1]) ;
    }
    int x, y, diff, sh;

    for (i = 1; i <= m; ++i) {
    f >> x >> y;
    diff = y - x + 1;
    l = lg[diff];
    sh = diff - (1 << l);
    g << min(rmq[l][x], rmq[l][x + sh]) << "\n";
    }


    return 0;
}