#include <iostream>
#include <fstream>
#define N 100002
using namespace std;

ifstream x("rmq.in");
ofstream y("rmq.out");

int n,m;
int log2[N],d[22][N];

void citire()
{
    x>>n>>m;
    for(int i=1;i<=n;i++)
        x>>d[0][i];
}

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

void solve()
{
    for(int i=1;i<=log2[n];i++)
        for(int j=1;j<=n-(1<<(i-1));j++)
            d[i][j]=min(d[i-1][j],d[i-1][j+(1<<(i-1))]);
    int a,b,k;
    for(int i=1;i<=m;i++)
    {
        x>>a>>b;
        k=log2[b-a+1];
        y<<min(d[k][a],d[k][b-(1<<k)+1])<<'\n';
    }
}

int main()
{
    citire();
    f_log2();
    solve();
    x.close();
    y.close();
    return 0;
}