#include <cstdio>
#include <algorithm>
#include <cmath>
#define N 100001
using namespace std;
int a[N],rmq[20][N],n,nr,m;
void read()
{
int i,j;
freopen("rmq.in","r",stdin);
freopen("rmq.out","w",stdout);
scanf("%d%d",&n,&m);
for (int i=1;i<=n;++i)
    {
    scanf("%d",&a[i]);
    rmq[0][i]=a[i];
    }
for (i=1;1<<i<=n;i++)
for (j=1;j+(1<<(i-1))<=n;j++)
rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+(1<<(i-1))]);
}
int interog(int x,int y)
{
int k;
k=log2(y-x+1);
return min(rmq[k][x],rmq[k][y-(1<<k)+1]);
}
int main()
{
int x,y;
read();
while (m-->1)
   {
   scanf("%d%d",&x,&y);
   printf("%d\n",interog(x,y));
   }
scanf("%d%d",&x,&y);
printf("%d",interog(x,y));
return 0;
}