#include <cstdio>
#include <algorithm>
using namespace std;
int N, M, i, j, x, y, nr, k, D[20][100100], lg[100100];
int main()
{
    freopen("rmq.in", "r", stdin);
    freopen("rmq.out", "w", stdout);
    scanf("%d%d", &N, &M);
    lg[1]=0;
    for (i=2;i<=N;i++)
        lg[i]=lg[i/2]+1;

    for (i=1; i<=N; i++) scanf("%d", &D[0][i]);

    for (i=1; i<=lg[N]; i++)
        for (j=1; j<=N-(1<<(i-1)); j++)
            D[i][j]=min(D[i-1][j], D[i-1][j+(1<<(i-1))]);

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