#include <cstdio>
#define min(a,b) (a < b ? a : b)

using namespace std;

const int nmx = 100002;

int n,m;
int dp[20][nmx];

void citire(){
    scanf("%d %d", &n, &m);
    for(int i = 1; i <= n; ++i)
        scanf("%d", &dp[0][i]);
}

void dinamica(){
    for(int i = 1; (1 << i) <= n; ++i)
        for(int j = 1; j + (1 << i) - 1 <= n; ++j)
            dp[i][j] = min(dp[i-1][j],dp[i-1][j+(1<<(i-1))]);
}

int log(int lim){
    int val = 1;
    while((1 << val) < lim)
        ++ val;
    -- val;
    return val;
}

void query(){
    int x,y,k;
    for(int i = 1; i <= m; ++i){
        scanf("%d %d", &x, &y);
        k = log(y-x);
       printf("%d\n", min(dp[k][x],dp[k][y-(1<<k)+1]));
    }
}

int main(){
    freopen("rmq.in", "r", stdin);
    freopen("rmq.out", "w", stdout);
    citire();
    dinamica();
    query();
    return 0;
}