#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <queue>
#include <stack>
#include <cstring>

using namespace std;

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

const int DIM = 100005;
const int LMAX = 18;

int rmq[LMAX][DIM],n,m,v[DIM],lg[DIM],x,y;

int main()
{
    fin>>n>>m;
    for(int i=1;i<=n;i++)
        fin>>v[i];
    lg[1]=0;
    for(int i=2;i<=n;i++)
        lg[i]=lg[i/2]+1;
    for(int i=1;i<=n;i++)
        rmq[0][i]=v[i];
    for(int i=1;(1<<i)<=n;i++)
    {
        for(int j=1;j<=n-(1<<i)+1;j++)
        {
            int l=(1<<(i-1));
            rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+l]);
        }
    }
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y;
        int diff=y-x+1;
        int l=lg[diff];
        int sh=diff-(1<<l);
        fout<<min(rmq[l][x],rmq[l][x+sh])<<'\n';
    }
}