#include <iostream>
#include <fstream>

using namespace std;

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

int rmq[100000][20];
int n, m, x, y, put;

int main()
{
    fin>>n>>m;

    for(int i=0;i<n;i++){
        fin>>rmq[i][0];
    }

    for(int j=1;1<<j<=n;j++){
        put=1<<(j-1);
        for(int i=0;(i+(1<<j)-1)<n;i++){
            rmq[i][j] = (rmq[i][j-1] < rmq[i+put][j-1]) ? rmq[i][j-1] : rmq[i+put][j-1];
        }
    }

    for(int k=0;k<m;k++){
        fin>>x>>y;
        x--;y--;
        put=31-__builtin_clz(y-x+1);
        int res = (rmq[x][put] < rmq[y-(1<<put)+1][put]) ? rmq[x][put] : rmq[y-(1<<put)+1][put];
        fout << res;
        fout<<"\n";
    }

    return 0;
}