#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");

const int INF=1e9;
const int NMAX=1e5+5;
int n, m;
int v[NMAX], rmq[32][NMAX], e[NMAX];

int main()
{
    fin>>n>>m;

    for(int i=1;i<=n;i++)
        fin>>v[i];

    for(int i=1;i<=n;i++)
        rmq[0][i]=v[i];

    for(int p=1;(1<<p)<=n;p++){
        for(int i=1;i<=n-(1<<p)+1;i++){
            rmq[p][i]=min(rmq[p-1][i], rmq[p-1][i+(1<<p-1)]);
        }
    }

    e[1]=0;
    for(int i=2;i<=n;i++){
        e[i]=e[i/2]+1;
    }

    int a, b;
    while(m--){
        fin>>a>>b;
        int p=e[b-a+1];
        int len=(1<<p);
        fout<<min(rmq[p][a], rmq[p][b-len+1])<<'\n';
    }



    return 0;
}