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


class InParser {
    vector<char> str;
    int ptr;
    ifstream fin;

    char getChar() {
        if (ptr == int(str.size())) {
            fin.read(str.data(), str.size());
            ptr = 0;
        }
        return str[ptr++];
    }

    template<class T>
    T getInt() {
        char chr = getChar();
        while (!isdigit(chr) && chr != '-')
            chr = getChar();
        int sgn = +1;
        if (chr == '-') {
            sgn = -1;
            chr = getChar();
        }
        T num = 0;
        while (isdigit(chr)) {
            num = num * 10 + chr - '0';
            chr = getChar();
        }
        return sgn * num;
    }

public:
    InParser(const char* name) : str(1e5), ptr(str.size()), fin(name) { }
    ~InParser() { fin.close(); }

    template<class T>
    friend InParser& operator>>(InParser& in, T& num) {
        num = in.getInt<T>();
        return in;
    }
};
int a[18][100002],b[100002];
int n,m,i,j,p, x,y,e,lung;
int main()
{
    freopen("rmq.out","w", stdout);
    InParser fin("rmq.in");

    fin>>n>>m;
    for( i=1;i<=n;i++)
        fin>>a[0][i];

    for(  p=1;(1<<p)<=n;p++)
        for( i=1;i<=n;i++)
        {
            a[p][i]=a[p-1][i];
            j=i+(1<<(p-1));
            if(j<=n&&a[p][i]>a[p-1][j])
                a[p][i]=a[p-1][j];
        }
    b[1]=0;
    for( i=2;i<=n;i++)
        b[i]=1+b[i/2];

    for( i=1;i<=m;i++)
    {
        fin>>x>>y;
        e=b[y-x+1];
        lung=(1<<e);
        printf("%d",a[e][x]>a[e][y-lung+1]?a[e][y-lung+1]:a[e][x]); printf("\n");
    }

}