#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <stack>
#define NMAX 100005
using namespace std;
ifstream fin ("rmq.in");
ofstream fout ("rmq.out");
long int n,m,lg[NMAX],rmq[18][NMAX],a[NMAX];
int main()
{
    fin >> n >> m;
    for(int i=1;i<=n;++i)
        fin >> a[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] = a[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]);
        }
    }
    int diff,l,sh,x,y;
    for(int i=0;i<m;++i)
    {
        fin >>x >> y;
        diff = y-x+1;
        l=lg[diff];
        sh = diff - (1<<l);
        fout << min(rmq[l][x],rmq[l][x+sh]) << '\n';
    }
    return 0;
}