#include <bits/stdc++.h>

using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
const int NMAX = 100005;
const int LGMAX = 18;
long long rmq[NMAX][LGMAX],lg[NMAX];
int main()
{
    long long n,m,x,y,i,j,l;
    in >> n >> m;
    for (i = 2; i<=n; i++)
        lg[i] = lg[i/2]+1;
    for (i = 1; i<=n; i++)
    {
        in >> rmq[i][0];
        for (j = 1; (1<<j)<=i; j++)
            rmq[i][j] = min(rmq[i][j-1],rmq[i-(1<<(j-1))][j-1]);
    }
    for (i = 1; i<=m; i++)
    {
        in >> x >> y;
        l = lg[y-x+1];
        out << min(rmq[y][l],rmq[x+(1<<l)-1][l]) << "\n";
    }
}