#include <cstdio>
#include <algorithm>

using namespace std;
int N, M;
int RMQ[17][100005];
int loga2[100005];

int query(int a, int b)
{
    int dist = b - a + 1;
    int gap = loga2[dist];
    return min(RMQ[gap - 1][a], RMQ[gap - 1][b - (1<<(gap-1)) + 1]);
}

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

    scanf("%d%d",&N,&M);
    loga2[1] = 0;
    for(int i = 1; i <= N; ++i) {
        scanf("%d", &RMQ[0][i]);
        loga2[i] = loga2[i/2] + 1;
    }

    int gap = 1;
    for(int i = 1; i <= 16; ++i)
    {
        for(int j = 1; j <= N; ++j)
            if(j + gap <= N)
                RMQ[i][j] = min(RMQ[i-1][j], RMQ[i-1][j + gap]);
            else
                RMQ[i][j] = RMQ[i][j-1];

        gap *= 2;
    }
    for(int i = 1; i <= M; ++i) {
        int a,b;
        scanf("%d%d",&a,&b);
        printf("%d\n", query(a,b));
    }


    return 0;
}