#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;

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

int main() {
    int n, m; fin >> n >> m;
    int rmq[n][20];
    
    for (int i = 0; i < n; i++) { fin >> rmq[i][0]; }

    for (int j = 1; j <= (int)log2(n); j++) {
        for (int i = 0; i <= n - (1 << j); i++) {
            rmq[i][j] = min(rmq[i][j-1], rmq[i + (1 << (j-1))][j-1]);
        }
    }

    for (int i = 1; i <= m; i++) {
        int x, y; fin >> x >> y; x--; y--;
        auto lg = (int)log2(y - x + 1);
        int minrmq = min(rmq[x][lg], rmq[y - (1 << lg) + 1][lg]);
        
        fout << minrmq << endl;
    }

    fin.close(); fout.close(); return 0;
}