#include <bits/stdc++.h>
///https://www.youtube.com/watch?v=0jWeUdxrGm4
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");

const int nmax = 100005;
const int lgmax = 17; /// log in baza 2 din nmax

int M[lgmax][nmax];
int lg[nmax];
int a[nmax];
int n,m;

void read(){

    fin>>n>>m;
    for(int i = 1; i <= n; i ++){
        fin>>a[i];
        M[0][i] = a[i];
    }
}

void build_RMQ(){

    lg[1]=0;
	for (int i = 2; i <= n; i ++)
		lg[i] = lg[i / 2] + 1; ///precalculare pentru logaritmi

    for(int i = 1; (1 << i) <= n; i ++)
        for(int j = 1; j + (1 << i) - 1 <= n; j ++){
            int k = 1 << (i - 1);
            M[i][j]= min(M[i - 1][j], M[i - 1][j + k]);
		 }

}

int query(int st, int dr){

    int l = dr - st + 1;
    int k = lg[l];
    return min(M[k][st], M[k][dr - (1<<k) + 1]);

}

void solve(){

    int l, r;

    for(int i = 1; i <= m; i ++){
        fin>>l>>r;
        fout<<query(l, r)<<"\n";
    }

    fin.close();
    fout.close();
}
int main()
{
    read();
    build_RMQ();
    solve();
    return 0;
}