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

int n, m, rmq[20][100010];

int main(){
    ifstream cin ("rmq.in");
    ofstream cout ("rmq.out");
    cin >> n >> m;
    for (int i=1; i<=n; i++) cin >> rmq[0][i];
    int l = log2(n);
    for (int i=1; i<=l; i++){
        for (int j=(1<<i); j<=n; j++)
            rmq[i][j] = min(rmq[i-1][j], rmq[i-1][j - (1<<(i-1))]);
    }
    while (m--){
        int x, y;
        cin >> x >> y;
        int k = log2(y - x + 1);
        cout << min(rmq[k][y], rmq[k][x + (1<<k) - 1]) << "\n";
    }
    return 0;
}