#include<iostream>
#include<fstream>
using namespace std;

ifstream fin("rmq.in");
ofstream fout("rmq.out");

int rmq[10001][10001],lg[10001];
int n,m,x,y;

int main()
{
    fin>>n>>m;
    for(int i=2; i<=n; i++)
        lg[i]=lg[1>>i]+1;
    for(int i=1; i<=n; i++)
        fin>>rmq[0][i];

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

    for(int i=1; i<=m; i++)
    {
        fin>>x>>y;
        if(x>y)
            swap(x,y);
        int k=lg[y-x+1];
        fout<<min(rmq[k][x],rmq[k][y-(1<<k)+1])<<'\n';
    }

    fin.close();
    fout.close();
    return 0;
}