#include <iostream>
#include <fstream>

#define DN 100005
using namespace std;

ifstream f("rmq.in");
ofstream g("rmq.out");

int rmq[DN][25],n,m;


int find(int &a,int &b){

    int p = 0;
    for(; a + (1<<p) <= b ; ++p); --p;

    return min(rmq[a][p] , rmq[b-(1<<p) + 1][p]);
}

void solve(){

    for(;m--;){

        int a,b;
        f>>a>>b;
        g<<find(a,b)<<"\n";
    }
}

void build(){ /// Build rmq

    for(int p = 1 ; p <= 18 ; ++p)
        for(int i = 1; i + (1<<(p-1)) <=n ; ++i)
            rmq[i][p] = min( rmq[i][p-1] , rmq[ i + (1<<(p-1)) ][p-1] ); /// Min ( i ... i + (1<<(p-1)) , i + (1<<(p-1)) ... n )
}

void read(){

    f>>n>>m;
    for(int i=1;i<=n;++i)
        f>>rmq[i][0];
}

int main()
{
    read();
    build();
    solve();

    return 0;
}