#include <bits/stdc++.h>
#define MAXN 100002
#define LMAX 20
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
int n,m,rmq[LMAX][MAXN],a[MAXN],lg[MAXN];
int main()
{
    in>>n>>m;
    for(int i=1; i<=n; ++i)
        in>>a[i];
    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++)
        {
            rmq[i][j]= min( rmq[i-1][j] , rmq[i-1][j+1<<(i-1)] );
        }
    long int x,y,diff,sh;
    for (int i=1;i<=m;i++)
    {
        in>>x>>y;
        sh=y-x+1-(1<<lg[y-x+1]);
        out<<min(rmq[lg[y-x+1]][x],rmq[lg[y-x+1]][x+sh])<<'\n';
    }
    return 0;
}