#include <fstream>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
const int nmax = 100005;
int rmq[18][nmax], n, m;
int logaritmi[nmax];
int main(){
    f >> n >> m;
    for(int i = 1; i <= n; i++){
        f >> rmq[0][i];
    }
    logaritmi[1] = 0;
    for(int i = 2; i <= nmax; i++){
        logaritmi[i] = logaritmi[i / 2] + 1;
    }
    for(int p = 1; p <= 17; p++){
        for(int j = 1; j <= n; j++){
            rmq[p][j] = min(rmq[p - 1][j], rmq[p - 1][j + (1 << (p - 1))]);
        }
    }
    while(m--){
        int st, dr;
        f >> st >> dr;
        int putere = logaritmi[dr - st + 1];
        g << min(rmq[putere][st], rmq[putere][dr - (1 << putere) + 1]) << '\n';
    }
}