#include <bits/stdc++.h>

using namespace std;

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

int rmq[18][100001];


int qry(int x,int y)
{
    int p=1;
    int ct=0;
    while (p*2<=y-x+1)
    {
        p=p*2;    //calculam cea mai mare putere a lui doi mai mica decat lungimea
        ct++;
    }
    return min(rmq[ct][x], rmq[ct][y-p+1]);  //returnam ce mai mica valoare
}
int main()
{
    int n,m,x,y;
    fin>>n>>m;
    for (int i=1; i<=n; i++)
        fin>>rmq[0][i]; //formam prima linie
    for (int i=1,p=2; p<=n; i++,p*=2)
        for (int j=1; j<=n; j++)
        rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+p/2]); //formam tabloul in sine
    for (int i=1; i<=m; i++)
    {
        fin>>x>>y;
        fout<<qry(x,y)<<'\n';
    }
    return 0;
}