#include<fstream>
using namespace std;
int n, m, i, j, ii, jj, p;
int a[18][100001], v[100001];
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int main(){
    fin>> n >> m;
    for(i = 1; i <= n; i++){
        fin>> a[0][i];
    }
    for(i = 1; (1 << i) <= n; i++){
        for(j = 1; j <= n; j++){
            a[i][j] = a[i-1][j];
            if(j + (1 << (i-1)) <= n && a[i][j] > a[i-1][j+(1 << (i - 1))]){
                a[i][j] = a[i-1][j+(1 << (i - 1))];
            }
        }
    }
    for(i = 2; i <= n; i++){
        v[i] = v[i / 2] + 1;
    }
    for(i = 1; i <= m; i++){
        fin>> ii >> jj;
        p = v[jj - ii + 1];
        if(a[p][ii] < a[p][jj - (1 << p) + 1]){
            fout<< a[p][ii] <<"\n";
        }
        else{
            fout<< a[p][jj - (1 << p) + 1] <<"\n";
        }
    }
    return 0;
}