#include <iostream>
#include <fstream>
#define MAXN  100002
#define MAXLG 18
using namespace std;
int n,q,x,y,rmq[MAXN][MAXLG],e[MAXN];

ifstream fin("rmq.in");
ofstream fout("rmq.out");

int main()
{
    fin >> n >> q;
    e[1] = 0;
    for(int i = 2; i <= n; i++){
        e[i] = 1 + e[i/2];
    }
    for(int i = 1; i <= n; i++){
        cin >> rmq[i][0];
    }
    for(int i = 1; i <= e[n]; i++){
        for(int j = 1; j+(1<<(i-1)) <= n; j++){
            rmq[j][i] = min(rmq[j][i-1], rmq[j+(1<<(i-1))][i-1]);
        }
    }
    while(q--){
        fin >> x >> y;
        int len = x-y+1;
        int log = e[len];
        fout << min(rmq[x][log], rmq[y-(1<<log)+1][log]) << "\n";
    }
    return 0;
}