#include <iostream>
#include <fstream>
#define MAX 100002
#define MLG 18
using namespace std;
int n,m,rmq[MLG][MAX],e[MAX],x,y;

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

int main()
{
    fin >> n >> m;
    for(int i = 1; i <= n; i++){
        fin >> rmq[0][i];
    }
    e[1] = 0;
    for(int i = 2; i <= n; i++){
        e[i] = 1+e[i/2];
    }
    for(int i = 1; i <= e[n]; i++){
        for(int j = 1; j <= n; j++){
            rmq[i][j] = rmq[i-1][j];
            if(j+(1<<(i-1)) <= n){
                rmq[i][j] = min(rmq[i][j], rmq[i-1][j+(1<<(i-1))]);
            }else{
                break;
            }
        }
    }
    for(int i = 1; i <= m; i++){
        fin >> x >> y;
        int len = y-x+1;
        int exp = e[len];
        fout << min(rmq[exp][x], rmq[exp][y-(1<<exp)+1]) << "\n";
    }
    return 0;
}