#include <bits/stdc++.h>
#define Nmax 100002

using namespace std;

ifstream fin("rmq.in");
ofstream fout("rmq.out");

int n,m,rmq[20][Nmax],p[Nmax];

void Puteri(int n)
{
    p[1]=0;
    for(int i=2;i<=n;i++)
        p[i]=1+p[i/2];
}

void RMQ()
{
    int i,j,L;

    L=p[n];
    for(i=1;i<=L;i++)
        for(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()
{
    fin>>n>>m;
    for(int i=1;i<=n;i++)
        fin>>rmq[0][i];
    Puteri(n);
    RMQ();

    int l;
    while(m--)
    {
        int x,y;
        fin>>x>>y;

        l=p[y-x+1];
        fout << min(rmq[l][x],rmq[l][y+1-(1 << l)]) << "\n";
    }

    return 0;
}