#include <fstream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#define pu(x) ((x^(x-1))&x)

using namespace std;

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

int n,m,i,a[100010],rmq[100010][22],j,logb2[100010],doi[100010];

int main()
{
    fin >> n >> m;
    doi[0]=1;
    for (i=1; i<20; i++)
        doi[i]=doi[i-1]*2;
    for (i=2; i<=n; i++)
        logb2[i]=logb2[i/2]+1;
    for (i=1; i<=n; i++)
        fin >> a[i];
    for (i=1; i<=n; i++)
        rmq[i][0]=a[i];
    for (i=1; i<=logb2[n]; i++)
        for (j=1; j+doi[i]-1<=n; j++)
            rmq[j][i]=min(rmq[j][i-1],rmq[j+doi[i-1]][i-1]);
    for (i=1; i<=m; i++)
    {
        int x,y,d;
        fin >> x >> y;
        d=logb2[y-x+1];
        fout << min(rmq[x][d],rmq[y-doi[d]+1][d]) << '\n';
    }
}