#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream in ("rmq.in");
ofstream out ("rmq.out");
int minim (int a, int b, int c, int d)
{
    if (a<b)
        return c;
    else
        return d;
}
void minimul (int a, int b)
{
    if (a>b)
        out<<b<<'\n';
    else
        out<<a<<'\n';
}
int main()
{
    int N, m;
    in>>N>>m;
    int v[N];
    int p=log2(N);
    int M[p][N];

    for (int i=0;i<N;++i)
    {
        in>>v[i];
        M[0][i]=i;
    }
    int N2, E;
    for (int i=1;i<=p;++i)
    {
        E=1<<i;
        N2=N-E;

        for (int j=0;j<=N2;++j) M[i][j]=minim( v[M[i-1][j]], v[M[i-1][j+(E>>1)]], M[i-1][j], M[i-1][j+(E>>1)]);
    }

    int a, b;
    for (int i=0;i<m;++i)
    {
        in>>a>>b;
        --a; --b;
        p=log2(b-a+1);
        minimul (v [M[p][a]], v[M[p][b-(1<<p)+1]]);
    }
    return 0;
}