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

int c[MAX][17],n;

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

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

    rmq();

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

    }
    return 0;
}