#include <bits/stdc++.h>
#define PII pair < int , int >
#define NMAX 100100
#define LOG 17

using namespace std;

int n, m;
int a[NMAX], R[NMAX][LOG], L[NMAX];

int solve(int x, int y) {
    int len = y - x + 1;
    int l = L[len];
    
    return min(R[x][l], R[y - (1 << l) + 1][l]);
}

int main(){
    ifstream cin("rmq.in");
    ofstream cout("rmq.out");
    
    cin >> n >> m;
    for (int i = 2; i <= n; i++) {
        L[i] = L[i / 2] + 1;
    }

    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        R[i][0] = a[i];
    }

    for (int j = 1; j < LOG; j++ ) {
        for (int i = 1; i + (1 << j) - 1 < NMAX; i++) {
            R[i][j] = min(R[i][j - 1], R[i + (1 << (j - 1))][j - 1]);
        }
    }

    while (m--) {
        int x, y;
        cin >> x >> y;
        cout << solve(x, y) << "\n";
    }

    return 0;
}