/*#include <bits/stdc++.h>
using namespace std;
int n,m,a[100003]
int main()
{
return 0
}*/


#include <bits/stdc++.h>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int r[17][100010],i,m,p,a[1000010];
int main()
{fin>>n>>m;
for(i=1;i<=n;i++)fin>>r[0][i];
for(p=1;(1<<p)<=n;p++){
for(i=1;i+(1<<p)-1<=n;i++){r[p][i]=r[p-1][i];
int j=i+(1<<(p-1));
if(j<=n&&r[p][i]>r[p-1][j])
r[p][i]=r[p-1][j];
}
}
a[1]=0;
for(i=2;i<=n;i++)a[i]=a[i/2]+1;
for(i=1;i<=m;i++) {
fin>>st>>dr;
int t=a[dr-st+ 1];
fout<<min(r[t][st],r[t][dr-(1<<t)+1])<<"\n";
}
return 0;
}