#include <iostream>
#include <fstream>
#include <vector>
#include <cmath>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int main () {
    int n, m;
    vector<int> v;
    fin >> n >> m;
    int r = floor(log2(n));
    int rmq[n][r + 1];
    for (int i = 0; i < n; i++) {
        int x;
        fin >>x;
        v.push_back(x);
    }
    for (int i = 0 ; i < n ; i++)
        rmq[i][0] = v[i];
    for (int j = 1 ; j <= r; j++) {
        for (int i = 0; i < n; i++) {
                if (i + (1 << j) - 1 < n){
                    rmq[i][j] = min(rmq[i][j -1], rmq[i + (1 << (j - 1))][j - 1]);
            }
        }
    }
    for (int i = 0; i < m; i++) {
        int x,y; 
        fin >> x >> y;
        x--; y--;
        int len = y - x + 1;
        int k = log2(len);
        fout << min(rmq[x][k],rmq[y - (1 << k) + 1][k]) << endl;
        
    }
}