#include <bits/stdc++.h>
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
int N, M, i, j, st, dr, lg, lgg[100001], k, l, v[20][100001];

int main()
{
    in>>N>>M;
    for(i=1; i<=N; i++)
        in>>v[0][i];

    lg[1] = 0;
    for(i=2; i<=N; i++)
        lgg[i] = lgg[i/2]+1;

    for (i=1; i<=lgg[N]+1; i++)
    {
        for (j=1; j<=N-pow(2, i)+1; j++)
        {
            l=pow(2, i-1);
            v[i][j]= min(v[i-1][j], v[i-1][j+l]);
        }
    }

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

    }
    return 0;
}