#include <cstdio>
#include <algorithm>

using namespace std;

int lg[100010], v[17][100010];

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

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

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

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

    for (int i = 1; i <= lg[n]; i++)
        for (int j = 1; j <= n - (1 << i) + 1; j++)
            v[i][j] = min (v[i - 1][j], v[i - 1][j + (1 << (i - 1))]);

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

        int k = lg[y - x];

        printf ("%d\n", min (v[k][x], v[k][y - (1 << k) + 1]));
    }

    return 0;
}