# include <bits/stdc++.h>
#define NM 100003
using namespace std;

int a[NM], lg[NM];
int RMQ[20][NM];
int n, q;

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

    int i, j, k;
    scanf("%d %d", &n, &q);
    for(i=1; i<=n; ++i){
        scanf("%d", &a[i]);
        RMQ[0][i] = a[i];
    }

    lg[1]=0; ///calculam logaritm
    for (i=2; i<=n; ++i)
        lg[i] = lg[i/2] + 1;

    /// construire matrice
    for(i=1; i <= lg[n]; ++i)
        for(j=1; j <= n; ++j)
             RMQ[i][j] = min(RMQ[i-1][j], RMQ[i-1][j + (1<<(i-1))] );

    while (q--){
        scanf("%d %d", &i, &j);

        k = lg[j-i+1]; ///lungime segment
        printf ("%d\n", min(RMQ[k][i], RMQ[k][j-(1<<k)+1]) );
    }

    return 0;
}