#include <bits/stdc++.h>
#include <algorithm>
#define N 100002
#define LOGN 18

using namespace std;

long int n, m;
long int rmq[LOGN][N], lg[LOGN];

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

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

    lg[1]=0;
    for(long int i=2; i<=n; i++) lg[i]=lg[i/2]+1;

    for(long int i=1; (1<<i) <= n; i++)
    {
        for(long int j=1; j+(1<<i)-1 <= n; j++)
        {
            long int limita=1<<(i-1);
            rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+limita]);
        }
    }

    long int x,y,k,dif,p;
    for(long int i=1; i<=m; i++)
    {
        fin>>x>>y;
        dif=y-x+1;
        k=lg[dif];
        p=dif-(1<<k);
        fout<<min(rmq[k][x],rmq[k][p+x])<<'\n';
    }
    return 0;
}