/**
infoarena.ro/problema/rmq
Range Minimum Query
*/
#include <fstream>

using namespace std;
int n,q;
int vt[100010],log2[100010];
int m[20][100010];
void precalc()
{
    for(int i=2;i<=n;i++)
    {
        log2[i]=log2[i/2]+1;
    }
    for(int j=1;j<=n;j++)
    {
        m[0][j]=vt[j];
    }
    for(int i=1;(1<<i)<=n;i++)
    {
        for(int j=1;j<=n-(1<<i)+1;j++)
        {
            m[i][j]=min(m[i-1][j],m[i-1][j+(1<<(i-1))]);
        }
    }
}
int interv(int x,int y)
{
    int p=log2[y-x+1];
    return min(m[p][x],m[p][y-(1<<p)+1]);
}
int main()
{
    ifstream fin("rmq.in");
    ofstream fout("rmq.out");
    fin>>n>>q;
    for(int i=1; i<=n; i++)
    {
        fin>>vt[i];
    }
    precalc();
    int x,y;
    while( fin>>x>>y)
    {

        fout<<interv(x,y)<<endl;
    }
    return 0;
}