#include <bits/stdc++.h>

using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n,m,rmq[17][100005],i,lim,p,j,x,k,y;
int main()
{
    f>>n>>m;
    for (i=1;i<=n;i++)
    {
        f>>rmq[0][i];
    }
    lim=log2(n);
    p=1;
    for (i=1;i<=lim;i++)
    {
        for (j=1;j<=n-(1<<i)+1;j++)
        {
            rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+p]);
        }
        p=p*2;
    }
    for (i=1;i<=m;i++)
    {
        f>>x>>y;
        if (x==y)
        {
            g<<rmq[0][x]<<'\n';
            continue;
        }
        if (y<x)swap(x,y);
        k=log2(y-x);
        g<<min(rmq[k][x],rmq[k][y-(1<<k)+1])<<'\n';
    }
    return 0;
}