#include <iostream>
#include <fstream>
using namespace std;

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

const int maxn = 100000 + 10;
int N,M,v[maxn],rmq[18][maxn];
int Log[maxn];

void build_log(){
    int i;
    for(i=2;i<=N;i++)
        Log[i]=Log[i/2]+1;
}
void build_rmq(){
    int i,j;
    for(i=1;i<=N;i++)
        rmq[0][i]=i;
    int a,b;
    for(i=1;(1<<i)<=N;i++)
        for(j=1; j + (1<<i) - 1 <= N; j++){
            a=rmq[i-1][j];
            b=rmq[i-1][j+(1<<(i-1))];

            if(v[a]<=v[b])
                rmq[i][j]=a;
            else
                rmq[i][j]=b;
    }
}

int solve(int x,int y){

    if (y < x)
        swap (x, y);

    int dif=y-x+1;
    int log = Log[dif];
    int a,b;
    a=rmq[log][x];
    b=rmq[log][y - (1<<log) + 1];
    if(v[a]<=v[b])
        return a;
    else
        return b;

}

int main()
{
    int i,x,y;
    in>>N>>M;
    for(i=1;i<=N;i++)
        in>>v[i];

    build_log();
    build_rmq();

    while(M--){
        in>>x>>y;
        out<<v[solve(x,y)]<<"\n";
    }
    return 0;
}