#include <bits/stdc++.h>
#define int long long
#define ll long long
#define all(a) (a).begin(), (a).end()
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define sz() size()
#define fr first
#define sc second
#define pb push_back
#define er erase
#define in insert
#define mp make_pair
#define rc(s) return cout<<s,0
#define cin fin
#define cout fout
using namespace std;


#define inf 1000000000

ifstream fin("rmq.in");
ofstream fout("rmq.out");

const int mod=1e9+7;

int y,n,m,a[100005],rmq[100005][24],l,r,logr[100005];

void buildrmq(){
    for(int i=1;i<=logr[n];i++){
        for(int j=1;j<=n;j++){
            int c1=rmq[j][i-1];
            int h=min(j+(1<<(i-1)),n+1);
            int c2=rmq[h][i-1];
            if(c2==0) c2=inf;
            rmq[j][i]=min(c1,c2);
        }
    }
}

int32_t main(){
    ios_base::sync_with_stdio(0);cin.tie();cout.tie();
    cin >> n >> m;
    logr[1]=0;
    for(int i=2;i<=n;i++) logr[i]=logr[i/2]+1;
    for(int i=1;i<=n;i++) cin >> a[i];
    for(int i=1;i<=n;i++) rmq[i][0]=a[i];
    buildrmq();
    for(int i=1;i<=m;i++){
        cin >> l >> r;
        int cnt=(r-l);
        cnt=logr[r-l];
        y=(1<<cnt);
        cout << min(rmq[l][cnt],rmq[r-y+1][cnt])<<'\n';
    }
}