#include <stdio.h>
#include <iostream>
#include <cstring>
#include <stdlib.h>
#include <time.h>
#include <bitset>
#include <string>
#include <vector>
#include <math.h>
#include <stack>
#include <queue>
#include <list>
#include <set>
#include <limits.h>
#include <algorithm>
#include <deque>
#define nmax 100010
#define mod 1999999973
using namespace std;
int n,m,i,j,x,y,rmq[17][nmax],v[nmax],aux,d;
inline int min(int a,int b) { if (a<b) return a; else return b; }
int main(){
freopen("rmq.in","r",stdin);
freopen("rmq.out","w",stdout);
scanf("%d %d",&n,&m);
for (i=1;i<=n;i++) scanf("%d",&rmq[0][i]);
for (i=1;1<<i<=n;i++) {
    aux=1<<(i-1);
    for (j=1;j+aux<=n;j++)
        rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+aux]);
}
v[1]=0;
for (i=2;i<=n;i++) v[i]=v[i/2]+1;
for (i=1;i<=m;i++) {
    scanf("%d %d",&x,&y); aux=v[x-y+1]; d=1<<aux;
    printf("%d\n",min(rmq[aux][x],rmq[aux][y-d+1]));
}
return 0;
}