#include <iostream>
#include <bits/stdc++.h>
using namespace std;

ifstream fin("rmq.in");
ofstream fout("rmq.out");


long long n,m,i,j,l,x,y,z,d[14][100001],t,s=1;
int main()
{
    fin >> n >> m;
    for (i=1;i<=n;++i) fin >> d[1][i];
    t=ceil(log2(10001));


    for (i=2;i<=n;++i){
    for (l=1;l<=n-i+1;++l){
    z=d[1][l];
    for (j=l;j<=l+i-1;++j){
        if(z>d[1][j]) z=d[1][j];
    }
    d[i][l]=z;
    }
    }

    for (i=1;i<=m;++i) {
        fin >> x >> y;
        fout << d[y-x+1][x] << endl;
    }
    return 0;
}