#include <fstream>
using namespace std;
const int nmax = 100005;
int n, m;
int dp[10][nmax], log2[nmax];


int main(){
    ifstream f("rmq.in");
    ofstream g("rmq.out");
    f >> n >> m;
    for(int i = 1; i <= n; i++){
        f >> dp[0][i];
    }
    log2[1] = 0;
    for(int i = 2; i <= nmax; i++){
        log2[i] = log2[i / 2] + 1;
    }
    for(int p = 1; p <= 9; p++){
        for(int j = 1; j <= n; j++){
            dp[p][j] = min(dp[p - 1][j], dp[p - 1][j + (1 << (p - 1))]);
        }
    }
    while(m--){
        int x, y;
        f >> x >> y;
        int lg = log2[y - x + 1];
        g << min(dp[lg][x], dp[lg][y - (1 << lg) + 1]) << '\n';
    }
}