#include <bits/stdc++.h>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int rmq[10000][10000],v[100000];
int n,t,a,b;

void set_rmq(int v[], int n)
{
    for (int i = 1; i <= n; i++)
        rmq[i][0] = i;

    for (int j=1;(1<<j)<=n;j++)
        for (int i=1;(i+(1<<j)-1)<=n;i++)
            if (v[
                rmq[i][j-1]] < v[rmq[i + (1<<(j-1))][j-1]])
                rmq[i][j] = rmq[i][j-1];
            else
                rmq[i][j] = rmq[i + (1 << (j-1))][j-1];

}


void maxim(int x, int y)
{
    int j = (int)log2(y-x+1);

    if (v[rmq[x][j]] <= v[rmq[y - (1<<j) + 1][j]])
        g<< v[rmq[x][j]]<<endl;
    else
        g<< v[rmq[y - (1<<j) + 1][j]]<<endl;
}



int main()
{
    f>>n>>t;
    for(int i=1; i<=n; i++)
        f>>v[i];

    set_rmq(v,n);


    for(int i=0; i<t; i++)
    {
            f>>a>>b;
            maxim(a,b);
    }


    f.close();
    g.close();
    return 0;

}