#include <iostream>
#include <fstream>
#include <cmath>

using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n,m,d[100001][1001];
int x,y,p;

int main()
{
    fin>>n>>m;
    for(int i=1;i<=n;i++)
    {
        fin>>d[i][0];
    }
    for(int j=1;j<=n;j++)
    {
        for(int i=1;i<=n;i++)
        {
            //if(i+(1<<j)<=n)
            {
                d[i][j]=min(d[i][j-1],d[i+(1<<(j-1))][j-1]);
            }
        }
    }
    /*for(int i=1;i<=n;i++)
    {
        for(int j=0;i+(1<<j)<=n;j++)
        {
            cout<<d[i][j]<<" ";
        }
        cout<<endl;
    }*/
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y;
        p = log2(y-x+1);
        fout<<min(d[x][p],d[y-(1<<p)+1][p])<<'\n';
    }
}