# include <bits/stdc++.h>

using namespace std;

const int Nmax = 1e5 + 5;

int rmq[17][Nmax], n, m, i, j, x, y, Log[17];

int main ()
{
    freopen("rmq.in", "r", stdin);
    freopen("rmq.out", "w", stdout);

    scanf("%d %d\n", &n, &m);

    for (i = 1; i <= n; ++i)
        scanf("%d ", &rmq[0][i]);

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

    for (i = 1; i <= Log[n]; ++i)
        for (j = 1; j <= n - (1 << (i - 1)); ++j)
            rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + (1 << (i - 1))]);

    for (i = 1; i <= m; ++i) {
        scanf("%d %d\n", &x, &y);
        int len = Log[y - x + 1];
        printf("%d\n", min(rmq[len][x], rmq[len][y - (1 << len) + 1]));
    }


    return 0;
}