#include <cstdio>
#include <cmath>
#include <algorithm>

using namespace std;

int rmq[100002][18];

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

    int n, m;
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; i++)
        scanf("%d", &rmq[i][0]);
    for (int j = 1; j <= log2((double)n); j++)
    {
        for (int i = 1; i <= n + 1 - (1<<j); i++)
            rmq[i][j] = min(rmq[i][j-1], rmq[i + (1<<(j-1))][j-1]);
    }

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

    return 0;
}