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

int n,m,rmq[100010][20],put[25],lg[100010];

int minim(int a,int b)
{
    if(a<b) return a;
    else return b;
}

int main()
{
    int i,j;
    ifstream t1("rmq.in");
    ofstream t2("rmq.out");
    t1>>n>>m;

    put[0]=1;
    for(i=1;i<=20;i++)
        put[i]=2*put[i-1];
    lg[1]=0;
    for(i=2;i<=n;i++) lg[i]=lg[i/2]+1;

    for(i=1;i<=n;i++) t1>>rmq[i][0];

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

    int a,b,l;
    for(i=1;i<=m;i++)
    {
        t1>>a>>b;
        l=lg[b-a+1];
        t2<<min( rmq[a][l], rmq[ b- put[l] +1 ][l] )<<'\n';
    }
    t1.close();
    t2.close();
    return 0;
}