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

using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
int n, m, k, R, L;
int v[1 << 17], st[17][1 << 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[0][i];
    }
    for (int j = 1; j <= 15; j++)
        for (int i = 0; i + (1 << j) <= n; i++)
            st[j][i] = min(st[j - 1][i], st[j - 1][i + (1 << (j - 1))]);

    int mn;
    for (int i = 0; i < m; i++) {
        in >> L >> R;
        L -=1;
        R -= 1;
        int j = lg[R - L + 1];
        mn = min(st[j][L], st[j][R - (1 << j) + 1]);
        out<<mn<<endl;
    }
    return 0;
}