#include <cstdio>
#include <cmath>

using namespace std;

int rmq[100002][30];

inline int min(int a, int b)
{
    if (a < b)
        return a;
    return b;
}

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(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 left, right;
    while (m--)
    {
        scanf("%d%d", &left, &right);
        int l = log2(right - left + 1);
        printf("%d\n", min(rmq[left][l], rmq[right-(1<<l)+1][l]));
    }


    return 0;
}