#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
#define MAX 100001

int n,r[MAX][18];

void rmq(){
    for(int j=1;(1<<j)<=n;j++)
    for(int i=0;i+(1<<j)<=n;i++)
        r[i][j]=min(r[i][j-1],r[i+(1<<(j-1))][j-1]);

    //for(int i=0;i<=10;i++){
    //for(int j=0;j<=5;j++)printf("%d ",r[i][j]); printf("\n"); }
}

int main(){
    int m,x,y;
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
        scanf("%d %d",&n,&m);
        for(int i=0;i<n;i++)scanf("%d",&r[i][0]);
    rmq();

        while(m--)
        {
            scanf("%d %d",&x,&y);
            int k = log(y-x+1)/log(2);
            printf("%d\n",min(r[x-1][k],r[y-(1<<k)][k]));
        }

    return 0;
}