#include <fstream>
#define nmax 100000
using namespace std;
ifstream cin("rmq.in");
ofstream cout("rmq.out");
long int n,rmq[20][nmax+1],a[nmax+1],log2[nmax+1];
void query()
{
    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+(1<<i)-1<=n; j++)
            rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+(1<<(i-1))]);
    for(int i=2; i<=n; i++)
        log2[i]=log2[i/2]+1;
}
int main()
{
    int x,y,m;
    cin>>n>>m;
    for(int i=1;i<=n;i++)
        cin>>a[i];
    query();
    for(int i=1; i<=m; i++)
    {
        cin>>x>>y;
        int k=log2[y-x+1];
        cout<<min(rmq[k][x],rmq[k][y-(1<<k)+1])<<'\n';

    }
}