#include <bits/stdc++.h>
using namespace std;
const int NMAX = 1e5+2;
const int LMAX = 18;
int n,m,x,y,lg2[NMAX];
int rmq[LMAX][NMAX];

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

int main()
{
    fin >> n >> m;
    for(int i = 1; i <= n; i++){
        fin >> rmq[0][i];
    }
    for(int l = 1; l < LMAX; l++){
        for(int i = 1; i+(1<<(l-1)) <= n; i++){
            rmq[l][i] = min(rmq[l-1][i], rmq[l-1][i+(1<<(l-1))]);
        }
    }
    lg2[1] = 0;
    for(int i = 2; i <= n; i++){
        lg2[i] = 1+lg2[i>>1];
    }
    while(m--){
        fin >> x >> y;
        int len = y-x+1;
        int log = lg2[len];
        fout << min(rmq[log][x], rmq[log][y-(1<<log)+1]) << "\n";
    }
    return 0;
}