#include<bits/stdc++.h>
using namespace std;
int rmq[100000][20];
int main() {
    int i, j, k, minrmq, n, m, x, y;
    ifstream fin ("rmq.in");
    ofstream fout ("rmq.out");
    fin>>n>>m;
    for(i=1;i<=n;i++) {
        fin >> rmq[i][0];
    }
    for (j = 1;j<=log2(n);j++) {
        for (i = 0; i <= n - (1<<j); i++) {
            rmq[i][j] = min(rmq[i][j-1], rmq[i+(1<<(j-1))][j-1]);
        }
    }

    while (m--) {
        fin >> x >> y;
        x--;
        y--;
        k = int(log2(y - x + 1));
        minrmq = min(rmq[x][k], rmq[y - (1<<k) + 1][k]);
        fout << minrmq << endl;
        cout << minrmq << endl;
    }
    return 0;
}