#include <bits/stdc++.h>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");

int r[17][100001];
int E[100001];
int n, m, i, j, st, dr, p, e, len;

int main() {
    fin >> n >> m;
    for(int i = 1; i <= n; i++)
        fin >> r[0][i];
        
    for(p = 1; (1 << p) <= n; p++)
        for(int i = 1; i <= n; i++) {
            r[p][i] = r[p-1][i];
            j = i + (1 << (p-1));
            if(j <= n && r[p][i] > r[p-1][j])
                r[p][i] = r[p-1][j];
        }
        
    E[1] = 0;
    for(int i = 2; i <= n; i++)
        E[i] = 1 + E[i/2];
        
    for(int i = 1; i <= m ; i++) {
        fin >> st >> dr;
        e = E[dr - st + 1];
        len = (1 << e);
        fout << min(r[e][st], r[e][dr - len + 1]) << endl;
    }
    
    return 0;
}