#include <fstream>
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>

using namespace std;
ifstream in("rmq.in");
//ifstream in("date.in");
ofstream out("rmq.out");
//ofstream out("date.out");

const int NMax = 1e5;
int N, M, RMQ[17][NMax];

void Read(){
    in >> N >> M;
    for (int i = 1; i <= N; ++i)
        in >> RMQ[0][i];
}

void Solve(){
    for (int i = 1; (1 << i) <= N; ++i)
        for (int j = 1; j <= N; ++j)
            RMQ[i][j] = min(RMQ[i - 1][j], RMQ[i - 1][j + (1 << (i - 1))]);
}

void Print(int x, int y){
    int k = log2(y -  x + 1);
    out << min(RMQ[k][x], RMQ[k][y - (1 << k) + 1]) << '\n';
}

int main(){
    Read();
    Solve();
    int x, y;
    while (M--){
        in >> x >> y;
        Print(x, y);
    }
    return 0;
}