/*
ID: Sho10
LANG: C++
TASK:
*/
#include <bits/stdc++.h> //JuniorMonster a.k.a Sho10
#define ll long long int
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define sz size
#define f first
#define s second
#define pb push_back
#define er erase
#define in insert
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod 1000000007
#define PI 3.14159265359
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
ll n,m,a[100005],rq[100005][25];
int32_t main(){
CODE_START;
ifstream cin("rmq.in");
ofstream cout("rmq.out");
cin>>n>>m;
for(ll i=1;i<=n;i++)
{
    cin>>a[i];

}
for(ll i=1;i<=n;i++)
    rq[i][0]=a[i];
for(ll j=1;j<=19;j++)
    for(ll i=1;i<=n;i++)
    if(i+(1<<(j-1))<=n){
       rq[i][j]=min(rq[i][j-1],rq[i+(1<<(j-1))][j-1]);
    }
while(m--){
    ll x,y;
    cin>>x>>y;
    ll logi=(y-x+1);
logi=floor(log2(logi));
    cout<<min(rq[x][logi],rq[y-(1<<logi)+1][logi])<<endl;
}
}