#include <iostream>
#include <bits/stdc++.h>
#include <fstream>

using namespace std;
ifstream in("RMQ.in");
ofstream out("RMQ.out");
int n, m, k, R, L;
int v[1 << 20], st[20][1 << 20];
int main() {
    in >> n >> m;
    for(int i=0;i<n;i++){
        in>>v[i];
    }
    for (int i = 0; i < n; i++) {
        st[i][0] = v[i];
    }
    k = int(log(n));
    for (int j = 1; j <= k; j++)
        for (int i = 0; i + (1 << j) <= n; i++)
            st[i][j] = min(st[i][j - 1], st[i + (1 << (j - 1))][j - 1]);

    int mn;
    for (int i = 0; i < m; i++) {
        in >> L >> R;
        L -=1;
        R -= 1;
        int j = log(R - L + 1);
        mn = min(st[L][j], st[R - (1 << j) + 1][j]);
        cout<<mn<<endl;
    }
    return 0;
}