#include <iostream>
#include <bits/stdc++.h>
#include <fstream>

using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
int n, m, R, L;
int st[1<<17][17];
int main() {
    in >> n >> m;
    int lg[n+1];
    lg[1] = 0;
    for (int i = 2; i <= n; i++)
        lg[i] = lg[i/2] + 1;
    for (int i = 0; i < n; i++) {
        in>>st[i][0];
    }
    for (int j = 1; j <= 15; j++)
        for (int i = 0; i + (1 << j) <= n; i++)
            st[i][j] = min(st[i][j - 1], st[i + (1 << (j - 1))][j - 1]);
    
    int j;
    for (int i = 0; i < m; i++) {
        in >> L >> R;
        L -=1;
        R -= 1;
        j = log2(R - L + 1);
        out<< min(st[L][j], st[R - (1 << j) + 1][j])<<"\n";
    }
    return 0;
}