#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n, m, i, j, exp, v[18][100005], st, dr, p[18], lg[100005];

int main(){
    fin >> n >> m;
    for (i = 1; i <= n; i++)
        fin >> v[0][i];

    p[0] = 1;
    for (i = 1; i <= 18; i++){
        p[i] = p[i-1] * 2;
    }
    lg[1] = 0;
    for (i = 2; i <= n; i++){
        lg[i] = 1 + lg[i/2];
    }
    for (i = 1; p[i] <= n; i++){
        for (j = 1; j <= n; j++){
            v[i][j] = v[i-1][j];
            if ( p[i-1] + j <= n  && v[i][j] > v[i-1][ j + p[i-1] ] )
                v[i][j] = v[i-1][ j + p[i-1] ];
        }

    }
    for (i = 1; i <= m; i++){
        fin >> st >> dr;
        exp = lg[dr - st + 1];
        fout << min( v[exp][st], v[exp][ dr - p[exp]+ 1 ] ) << "\n";
    }
    return 0;
}