#include <bits/stdc++.h>

using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n,m,a[100002][20],i,j,x,y,p;
int main()
{
  fin>>n>>m;
  for(i=1;i<=n;i++) fin>>a[i][0];
  for(j=1;(1<<j)<=n;j++)for(i=1;i+(1<<j)-1<=n;i++)a[i][j]=min(a[i][j-1],a[i+(1<<(j-1))][j-1]);
  for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        p=log2(y-x+1);
        fout<<min(a[x][p],a[y-(1<<p)+1][p])<<'\n';
    }
    return 0;
}