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

const int NMAX = 1e5;
int a[NMAX + 1], RMQ[NMAX + 1][20];

int query(int x, int y) {
    int L = int(log2(y - x + 1));
    return min(RMQ[x][L], RMQ[y - (1 << L) + 1][L]);
}

int main() {
    ifstream cin("rmq.in");
    ofstream cout("rmq.out");
    int n, m;
    cin >> n >> m;
    for(int i = 1; i <= n; i++) {
        cin >> a[i];
        RMQ[i][0] = a[i];
    }
    for(int j = 1; j <= ceil(log2(n)); j++) {
        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]);
        }
    }
    while(m--) {
        int x, y;
        cin >> x >> y;
        cout << query(x, y) << '\n';
    }
    return 0;
}