#include <bits/stdc++.h>
#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 pi pair<int,int>
#define pii pair<pair<int,int>,int>
#define mp make_pair
//#define int long long
#define rc(s) return cout<<s,0
#define rcc(s) cout<<s,exit(0)
using namespace std;
 
const int mod=1e9+7;
const int modp=1999999973;
const int modx=998244353;

int n,m,a[100005],rmq[100005][20];
 
int32_t main(){
 //   ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
  //  srand(chrono::steady_clock::now().time_since_epoch().count());
    ifstream fin("rmq.in");
    ofstream fout("rmq.out");
    fin >> n >> m;
    for(int i=1;i<=n;i++) fin >> a[i];
    for(int i=1;i<=n;i++) rmq[i][0]=a[i];
    for(int j=1;j<=19;j++){
    	for(int i=1;i<=n;i++){
    		if(i+(1<<(j-1))<=n)rmq[i][j]=min(rmq[i][j-1],rmq[i+(1<<(j-1))][j-1]);
		}
	}
	for(int i=1;i<=m;i++){
		int x,y;
		cin >> x >> y;
		int curr=(y-x+1);
		curr=floor(log2(curr));
		fout << min(rmq[x][curr],rmq[y-(1<<curr)+1][curr]) << '\n';
	}
	
}