#include <bits/stdc++.h>
using namespace std;
#define int long long
//#define fin cin
//#define fout cout
int a[100005],n,m,p[18];
int minim[18][100005];
signed main() {
    ifstream fin("rmq.in");
    ofstream fout("rmq.out");
    fin >> n >> m;
    for (int i = 1;i <= n;i++){
        fin >> a[i];
        minim[0][i] = a[i];
    }
    int pm = 16;
    while ((1 << pm) > n) pm--;
    for (int i = 1;i <= pm;i++)
    for (int j = 1;j <= n-(1 << i)+1;j++){
        minim[i][j] = min(minim[i-1][j],minim[i-1][j+(1 << (i-1))]);
    }
    for (int i = 1;i <= m;i++){
        int x,y;
        cin >> x >> y;
        int lung = y-x+1;
        int pmm = pm;
        while ((1 << pmm) > lung) pmm--;
        fout << min(minim[pmm][x],minim[pmm][y-(1 << pmm)+1]) << "\n";
    }
}