#include <bits/stdc++.h>

using namespace std;

#define INFILE "rmq.in"
#define OUTFILE "rmq.out"

const int N_MAX = 1e5;
const short LOG_MAX = 18;

int n, queries;
int lg[N_MAX + 5];
int rmq[LOG_MAX + 5][N_MAX + 5];

void solve(){

    lg[1] = 0;
    for(int i = 2; i <= N_MAX; ++i){
        lg[i] = lg[i >> 1] + 1;
    }

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

    for(int bit = 1; bit <= lg[n]; ++bit){
        for(int i = 1; i + (1 << bit) - 1 <= n; ++i){
            rmq[bit][i] = min(
                rmq[bit - 1][i],
                rmq[bit - 1][i + (1 << (bit - 1))]
            );
        }
    }

    while(queries--){
        int left, right; cin >> left >> right;
        int layer = lg[right - left + 1];
        cout << min(
            rmq[layer][left],
            rmq[layer][right - (1 << layer) + 1]
        ) << '\n';
    }


}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    freopen(INFILE, "r", stdin);
    freopen(OUTFILE, "w", stdout);
    solve();
    return 0;
}