#include <bits/stdc++.h>
using namespace std;
ifstream fin  ("rmq.in");
ofstream fout ("rmq.out");
int n, q, st, dr, rmq[100005][17];
int main (){
    fin>>n>>q;
    for(int i=1; i<=n; i++)
        fin>>rmq[i][0];

    for(int j=1; (1<<j)<=n; j++)
        for(int i=1; i<=n; i++){
            rmq[i][j] = rmq[i][j-1];
            if(i+(1<<(j-1)) <= n)
                rmq[i][j] = min(rmq[i][j], rmq[i+(1<<(j-1))][j-1]);
        }

    while(q--){
        fin>>st>>dr;
        n = (int)log2(dr-st+1);
        fout<<min(rmq[st][n], rmq[dr-(1<<n)+1][n])<<"\n";
    }
    return 0;
}