#include <bits/stdc++.h>

using namespace std;
int n, m, i, r[18][100005], nn, x, y, lg, a[100005], j;
int main()
{
    freopen("rmq.in", "r", stdin);
    freopen("rmq.out", "w", stdout);
    scanf("%d%d", &n, &m);
    for(i = 1; i <= n; i++)
        scanf("%d", &r[0][i]);
    nn = log2(n);
    nn++;
    for(i = 1; i <= nn; i++)
        for(j = 1;( j + (1 << (i)-1)) <= n; j++)
            r[i][j] = min(r[i - 1][j], r[i - 1][j + (1 << i)-1]);
    for(i = 2; i <= n; i <<= 1)a[i] = 1;
    for(i = 1; i <= n; i++)a[i] += a[i - 1];

    for(; m; m--)
    {
        scanf("%d%d", &x, &y);
        lg = y - x + 1;
        lg = a[lg];
        printf("%d\n", min(r[lg][x], r[lg][y - (1 << lg) + 1]));
    }
    return 0;
}