#include <fstream>
//#include <iostream>

using namespace std;

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

int r[17][100001],log[100001];

int query(int p, int q)
{
    int l=log[q-p+1];
    //cout << p << ", " << q << ", " << l << ", " << q-(1<<l)+1 << "\n";
    //cout << r[l][p] << " " << r[l][q-(1<<l)+1] << "\n\n";
    return min(r[l][p], r[l][q-(1<<l)+1]);
}

int main()
{
    int n,m,x,y;
    in>>n>>m;
    for(int i=1; i<=n; i++) in>>r[0][i];
    for (int i = 1; (1<<i) <= n; i++)
    {
        for (int j = 1; j + (1<<i) - 1 <= n; j++)
        {
            r[i][j] = min(r[i-1][j], r[i-1][j+(1<<(i-1))]);
        }
    }
    log[1]=0;
    for(int i=2; i<=n; i++)
    {
        log[i]=1+log[i/2];
    }
    /*for(int i=0; (1<<i)<=n; i++)
    {
        for(int j=1; j<=n; j++) out<<r[i][j]<<" ";
        out<<"\n";
    }
    out<<"\n";*/
    for(int i=1; i<=m; i++)
    {
        in>>x>>y;
        out<<query(x, y)<<"\n";
    }
    return 0;
}