// compile: make data
// run: ./data < data.in
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#ifdef LOCAL
#include <debug/codeforces.h>
#define debug(x...) _debug_print(#x, x);
#define Debug(x...) _debug_print_format(#x, x);
#else
#define debug(x...)
#define Debug(x...)
#endif
template<typename...Args> void print_(Args...args){((cout<<args<<" "),...)<<endl;}
#define VI vector<int>
#define VII vector<vector<int>>
#define VIII vector<vector<vector<int>>>
#define rep(i,a,b) for(int i=(a);i<(int)(b);++i)
#define sz(v) ((int)(v).size())
#define print(...) print_(__VA_ARGS__);
#define FIND(a, x) ((find(a.begin(),a.end(),(x))!=a.end())?1:0)
#define cmin(x,...) x=min({(x), __VA_ARGS__})
#define cmax(x,...) x=max({(x), __VA_ARGS__})
#define INTMAX (int)(9223372036854775807)
#define INF (int)(1152921504606846976)
#define double long double
#define int long long
#define MAXN 200010

struct STmin {
    vector<int> a, lg;
    vector<vector<int>> dp;
    STmin(vector<int> v) {
        a = v;
        build();
    }
    void build() {
        int logn = log2(sz(a)) + 2;
        dp.assign(sz(a), vector<int>(logn, 0));
        rep(i, 0, sz(a)) dp[i][0] = a[i];
        rep(j, 1, logn) {
            rep(i, 0, sz(a)) {
                dp[i][j] = min(dp[i][j-1], dp[min(i + (1 << (j-1)), sz(a)-1)][j-1]);
            }
        }
        lg.resize(sz(a)+1); lg[1] = 0;
        rep(i, 2, sz(a)+1) lg[i] = lg[i/2] + 1;
    }
    int query(int l, int r) {
        int j = lg[r - l + 1];
        return min(dp[l][j], dp[r - (1 << j) + 1][j]);
    }
};

struct STmax {
    vector<int> a, lg;
    vector<vector<int>> dp;
    STmax(vector<int> v) {
        a = v;
        build();
    }
    void build() {
        int logn = log2(sz(a)) + 2;
        dp.assign(sz(a), vector<int>(logn, 0));
        rep(i, 0, sz(a)) dp[i][0] = a[i];
        rep(j, 1, logn) {
            rep(i, 0, sz(a)) {
                dp[i][j] = max(dp[i][j-1], dp[min(i + (1 << (j-1)), sz(a)-1)][j-1]);
            }
        }
        lg.resize(sz(a)+1); lg[1] = 0;
        rep(i, 2, sz(a)+1) lg[i] = lg[i/2] + 1;
    }
    int query(int l, int r) {
        int j = lg[r - l + 1];
        return max(dp[l][j], dp[r - (1 << j) + 1][j]);
    }
};

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);

    int n, q; cin >> n >> q;
    vector<int> a(n);
    rep(i, 0, n) cin >> a[i];
    STmin st(a);
    while (q--) {
        int l, r; cin >> l >> r;
        cout << st.query(l-1, r-1) << endl;
    }

    return 0;
}