#include <bits/stdc++.h>

using namespace std;

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

int n,m,d[100010][20],i,j,x,y,p;
int main()
{
    f>>n>>m;
    for(i=1; i<=n; i++)
        f>>d[i][0];
    for(j=1; (1<<j)<=n; j++)
        for(i=1; i+(1<<j)-1<=n; i++)
            d[i][j]=min(d[i][j-1],d[i+(1<<(j-1))][j-1]);
    for(i=1; i<=m; i++)
    {
        f>>x>>y;
        p=log2(y-x+1);
        g<<min(d[x][p],d[y-(1<<p)+1][p])<<'\n';
    }
    return 0;

}