#include <bits/stdc++.h>
#define MAXN 100005

using namespace std;

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

long long rmq[20][MAXN];
long long lg[MAXN], n, m, x, y, l, diff, sh;

int main()
{
    long long i, j, l;
    in >> n >> m;
    for (i=1; i<=n; i++)
        in >> rmq[0][i];
    for (i=2; i<=n; i++)
        lg[i]=lg[i/2]+1;
    for (i=1; (1<<i)<=n; i++)
        for (j=1; j<=n-(1<<i)+1; j++)
        {
            l=1<<(i-1);
            rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+l]);
        }
    for (i=1; i<=m; i++)
    {
        in >> x >> y;
        diff=y-x+1;
        l=lg[diff];
        sh=diff-(1<<l);
        out << min(rmq[l][x],rmq[l][x+sh]) << '\n';
    }
    return 0;
}