#include <bits/stdc++.h>

using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
#define cin fin
#define cout fout
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define eb emplace_back
#define Inf 0x3f3f3f3f
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<ll,ll> pll;
typedef vector<pair<ll,ll>> vpl;
const int Nmax = 100010;
const int LOG = 17;

int n,q,dp[Nmax][LOG];

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    cin>>n>>q;
    for(int i=1;i<=n;i++)
        cin>>dp[i][0];
    for(int j=1;j<=LOG;j++)
        for(int i=1;i + (1<<j) - 1 <= n;i++)
        dp[i][j] = min(dp[i][j-1],dp[i + (1<<(j-1))][j-1]);
    for(int i=1;i<=q;i++)
    {
        int l,r;
        cin>>l>>r;
        if(l > r)
            swap(l,r);
        int p = 0;
        while((1<<(p+1))<=r-l+1) p++;
        cout<<min(dp[l][p],dp[r-(1<<p) + 1][p])<<'\n';
    }
    return 0;
}