#include <stdio.h>
#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
using namespace std;
int n,m,i,j,rmq[17][nmax],x,y,v[nmax];
inline int min(int a,int b)
{
    if (a<b) return a; else return b;
}
inline void buildrmq()
{
    int i,j,aux;
    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]);
    }
    for (i=2;i<=n;i++) v[i]=v[i/2]+1;
}
inline int query(int x,int y)
{
    int aux,d; d=v[y-x+1]; aux=1<<d;
    return min(rmq[d][x],rmq[d][y-aux+1]);
}
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]);
buildrmq();
for (i=1;i<=m;i++){
    scanf("%d%d",&x,&y);
    printf("%d\n",query(x,y));
}
return 0;
}