#include <bits/stdc++.h>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n,m,x,y,p[100005];
int rmq[20][100005];
void RMQ()
{
    for(int i=2; i<=n; i++)
        p[i]=p[i/2]+1;
    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))]);
}

int main()
{
    f>>n>>m;
    for(int i=1; i<=n; i++)
        f>>rmq[0][i];
    RMQ();
    for(int i=1; i<=m; i++)
    {
        f>>x>>y;
        int p1=p[y-x+1];
        g<<min(rmq[p1][x],rmq[p1][y-(1<<p1)+1]) << endl;
    }
    return 0;
}