#include <bits/stdc++.h>

using namespace std;

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

int n, m;
int lg[100002], x[100002];
int rmq[18][100002];

int main()
{
    fin>>n>>m;
    for(int i=1; i<=n; ++i) fin>>x[i];
    lg[1]=0;
    for(int i=2; i<=n; ++i)
    {
        lg[i]=lg[i/2]+1;
    }
    for(int i=1; i<=n; ++i) rmq[0][i]=x[i];
    for(int i=1; (1<<i)<=n; ++i)
    {
        for(int j=1; j<=n-(1<<i)+1; ++j)
        {
            int l=1<<(i-1);
            rmq[i][j]=min(rmq[i-1][j], rmq[i-1][j+l]);
        }
    }
    for(int i=1; i<=m; ++i)
    {
        int a, b;
        fin>>a>>b;
        int dif=b-a+1;
        int l=lg[dif];
        int sh=dif-(1<<l);
        fout<<min(rmq[l][a], rmq[l][a+sh])<<"\n";
    }
    return 0;
}