#include <bits/stdc++.h>
using namespace std;
const int N = 1e5+1;

ifstream f("rmq.in");
ofstream g("rmq.out");

int  rmq[20][N], lg[N];

int main(){
    int n,m,i,j,x,y,p;
    f>>n>>m;
    for(i=1; i<=n; i++)
        f>>rmq[0][i];

    lg[1]=0;
    for(i=2; i<=n; i++)
    lg[i]=lg[i/2]+1;
    for(i=1; i<=lg[n]; i++)
            for(j=1; j<=n-(1<<i)+1; j++)
            rmq[i][j]= min(rmq[i-1][j], rmq[i-1][j+(1<<(i-1))]);

    for(i=1;i<=m; i++){
        f>>x>>y;
        p=lg[y-x+1];
        g<<min(rmq[p][x], rmq[p][y-(1<<p)+1])<<"\n";
    }
return 0;
}