#include <bits/stdc++.h>
using namespace std;

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

int n, m, i, j, st, dr, lg, lg1[100001], k, l, a[20][100001];

int main()
{
    in>>n>>m;
    for(i=1; i<=n; i++)
        in>>a[0][i];

    lg1[1] = 0;
    for(i=2; i<=n; i++)
        lg1[i] = lg1[i/2]+1;

    for (i=1; i<=lg1[n]+1; i++)
    {
        for (j=1; j<=n-pow(2, i)+1; j++)
        {
            l=pow(2, i-1);
            a[i][j]= min(a[i-1][j], a[i-1][j+l]);
        }
    }

    for(i=1; i<=m; i++)
    {
        in>>st>>dr;
        k = lg1[dr-st+1];
        lg = pow(2, k);
        out<<min(a[k][st], a[k][dr-lg+1])<<'\n';

    }
    return 0;
}