#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define MAXN 100002
#define LOGMAXN 18

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

long long rmq[LOGMAXN][MAXN], n, m, lg[MAXN], a[MAXN];

int main() {
    cin.tie(NULL);
    ios_base :: sync_with_stdio (false);
    long long i,j,l;
    in >> n >> m;
    for (int i = 1; i <= n; i++) {
        in >> a[i];
    }
    lg[1] = 0;
    for (i = 2; i <= n; i++) {
        lg[i] = lg[i / 2] + 1;
        // exponentul cel mai mare al unei puteri a lui doi
    }
    for (i = 1; i <= n; i++)
            rmq[0][i] = a[i];
    for (i = 1; (1 << i) <= n; i++) {
        for (int j = 1; j <= n - (1 << i) + 1; j++) {
            l = 1 << (i - 1);
            rmq [i][j] = min (rmq[i - 1][j], rmq[i - 1][j + 1]);
        }
    }
    long int x, y, sh, diff;
    for (i = 1; i <= m; i++) {
        in >> x >> y;
        diff = y - x + 1;
        l = lg[diff];
        sh = diff - (1 << l);
        out << min (rmq[l][x] , rmq[l][x + sh]) << endl;
    }
}