#include <bits/stdc++.h>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
const int MAXN = 200005;
int n, q;
int v[MAXN];
int st[MAXN][20];
int lg[MAXN];

int main() {
    fin >> n >> q;
    for (int i = 0; i < n; i++)
        fin >> v[i];
    lg[1] = 0;
    for (int i = 2; i <= n; i++)
        lg[i] = lg[i / 2] + 1;
    for (int i = 0; i < n; i++)
        st[i][0] = v[i];
    for (int j = 1; (1 << j) <= n; 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]);
        }
    }
    while (q--) {
        int L, R;
        fin >> L >> R;
        L--;R--;
        int len = R - L + 1;
        int k = lg[len];
        fout << min(st[L][k], st[R - (1 << k) + 1][k]) << "\n";
    }

    return 0;
}