#include <bits/stdc++.h>

using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
const int nx = 100001;
int rmq[19][nx],n,m,st,dr,l;
int lg[nx];
/// rmq[i][j] = minimul din secventa care incepe de la pozitia j si are lungimea 2^i
int main()
{
    in>>n>>m;
    for(int i=1; i<=n; i++)
    {
        in>>rmq[0][i];
        if(i>=2)
            lg[i]=lg[i/2]+1;
    }
    for(int i=1; (1<<i)<=n; i++)
        for(int j=1; j+(1<<(i-1))<=n; j++)
            rmq[i][j] = min(rmq[i-1][j],rmq[i-1][j+(1<<(i-1))]);
    for(;m;m--)
    {
        in>>st>>dr;
        l = dr - st + 1;
        l = lg[l];
        out<<min(rmq[l][st],rmq[l][dr-(1<<l)+1])<<'\n';
    }
    return 0;
}