# include <bits/stdc++.h>

using namespace std;

const int Nmax = 100000 + 5;

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

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 ", &d[0][i]);

    Log[1] = 0;

    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)
            d[i][j] = min(d[i - 1][j], d[i - 1][j + (1 << (i - 1))]);

    for (i = 1; i <= m; ++i){
        scanf("%d %d\n", &x, &y);

        int k = Log[y - x + 1];

        ans = min(d[k][x], d[k][y - (1 << k) + 1]);

        printf("%d\n", ans);
    }

    return 0;
}