#include <bits/stdc++.h>
using namespace std;

#define lmax 100000
#define nmax 100000
#define nl '\n'

int rmq[lmax+2][23];
int n, m;
int lg2[nmax + 2];
int v[lmax+2];

void solve();
void read();
void initPow2();
int checkPow2(int a);
void queries();

int main() {

    solve();
    return 0;
}

void solve() {

    read();
    initPow2();
    queries();

}

void read() {

    cin >> n >> m;
    for (int i = 1; i <= n; i++) {

        cin >> v[i];
        rmq[i][0] = v[i];
    }
    cout << nl;

    for (int j = 1; j <= n; j -= -1) {
        for (int i = 1; i <= n - (1 << j) + 1; ++i) {

            rmq[i][j] = min(rmq[i][j - 1], rmq[i + (1 << (j - 1))][j - 1]);
            cout << i << ' ' << j << ' ' << rmq[i][j] << nl;
        }
    }
}

void initPow2() {

    lg2[1] = 0;
    for (int i = 2; i <= nmax; ++i) {

        lg2[i] = lg2[i / 2] + 1;
    }
}

int checkPow2(int a) {

    return lg2[a];
}

void queries() {

    int x, y, l;
    for (int i = 0; i < m; ++i) {

        cin >> x >> y;
        l = y - x + 1;

        cout << min(rmq[x][lg2[l]], rmq[y - (1 << lg2[l]) + 1][lg2[l]]) << nl;
    }
}