#include <bits/stdc++.h>
#define ll long long
#define cin fin
#define cout fout
using namespace std;

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

int n, m;
int minTable[100005][15];

int main() {
    ios :: sync_with_stdio(0);
    cin.tie(0);

    cin >> n >> m;
    for (int i = 1; i <= n; ++i) {
        cin >> minTable[i][0];
    }

    for (int exp = 1; exp <= 13; ++exp) {
        for (int start = 1; start <= n; ++start) {
            minTable[start][exp] = min(minTable[start][exp - 1], minTable[start + (1 << (exp - 1))][exp - 1]);
        }
    }

    for (int query = 1; query <= m; ++query) {
        int i, j;

        cin >> i >> j;

        int length = (j + 1 - i);
        int logN = 0;
        while (length > 1) {
            ++logN;
            length >>= 1;
        }

        cout << min(minTable[i][logN], minTable[j - (1 << logN) + 1][logN]) << '\n';
    }


    return 0;
}