#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("rmq.in");
ofstream gout("rmq.out");
int n,t[17][100001],lg2[100001];
void build()
{
    for(int i=1; n>=(1<<i); ++i)for(int j=1; j+(1<<i)-1<=n; ++j)
            t[i][j]=min(t[i-1][j],t[i-1][j+(1<<(i-1))]);
}
int query(int x,int y)
{
    int k=lg2[y-x+1];
    return min(t[k][x],t[k][y-(1<<k)+1]);
}
int main()
{
    int m,x,y;
    fin>>n>>m;
    lg2[0]=-1;
    for(int i=1; i<=n; ++i)
    {
        fin>>t[0][i];
        lg2[i]=lg2[i/2]+1;
    }
    lg2[0]=0;
    build();
    while(m--)
    {
        fin>>x>>y;
        gout<<query(x,y)<<'\n';
    }
    return 0;
}