#include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pli pair<ll,int>
#define pil pair<int,ll>
#define fi first
#define se second
#define inf (INT_MAX/2-1)
#define infl (1LL<<60)
#define vi vector<int>
#define vl vector<ll>
#define pb push_back
#define sz(a) (int)(a).size()
#define all(a) begin(a),end(a)
#define y0 y5656
#define y1 y7878
#define aaa system("pause");
#define dbg(x) cerr<<(#x)<<": "<<(x)<<'\n',aaa
#define dbga(x,n) cerr<<(#x)<<"[]: ";for(int _=0;_<n;_++)cerr<<x[_]<<' ';cerr<<'\n',aaa
#define dbgs(x) cerr<<(#x)<<"[stl]: ";for(int _:x)cerr<<_<<' ';cerr<<'\n',aaa
#define dbgp(x) cerr<<(#x)<<": "<<x.fi<<' '<<x.se<<'\n',aaa
#define maxn 100000

using namespace std;

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

int v[maxn+5], d[maxn+5][20], lg[maxn+5];

int rmq (int a, int b) {
  int ile = lg[b-a+1];
  return min(d[a][ile], d[b-(1<<ile)+1][ile]);
}

int main () {
  int n, m; fin >> n >> m;
  int i, j, z;
  for (i = 1; i <= n; i++) fin >> v[i];
  for (i = 2; i <= n; i++) lg[i] = lg[i>>1] + 1;
  for (i = 1; i <= n; i++) d[i][0] = v[i];
  for (j = 1; j <= lg[n]; j++)
    for (i = 1; i+(1<<j)-1 <= n; i++) d[i][j] = min(d[i][j-1], d[i+(1<<(j-1))][j-1]);
  while (m--) {
    int a, b; fin >> a >> b;
    fout << rmq(a, b) << '\n';
  }
  fin.close(); fout.close();
  return 0;
}