#include <fstream>
using namespace std;
ifstream cin("rmq.in");
ofstream cout("rmq.out");
const int NMAX = 1e5;
int a[NMAX + 1];
int rmq[NMAX + 1][20], LOG[NMAX + 1];

int query1(int x, int y) {
    int k = LOG[y - x + 1];
    return min(rmq[x][k], rmq[y - (1 << k) + 1][k]);
}

int main() {
    int n,m;
    cin >> n>>m;
    for(int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    for(int i = 2; i <= n; i++) {
        LOG[i] = LOG[i / 2] + 1;
    }
    for(int i = 1; i <= n; i++) {
        rmq[i][0] = a[i];
    }
    for(int j = 1; (1 << j) <= n; j++) {
        for(int i = 1; i + (1 << j) - 1 <= n; i++) {
            rmq[i][j] = min(rmq[i][j - 1], rmq[i + (1 << (j - 1))][j - 1]);
        }
    }
    int x,y;
    for(int i=1;i<=m;i++){
        cin>>x>>y;
        cout<<query1(x,y)<<'\n';
    }
}