#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n,m,d[100002][20],x,y,i,j;
int main()
{
    fin>>n>>m;
    for(i=1; i<=n; i++)
        fin>>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(int i=1; i<=m; i++)
    {
        fin>>x>>y;
        int p=log2(y-x+1);
        fout<<min(d[x][p],d[y-(1<<p)+1][p])<<endl;
    }
    return 0;
}