#include <cstdio>

using namespace std;

int rmq[100001][18];
int numere[100001],n,log[100001];

int funct_rmq(int a,int b)
{
    if (b-a==0)
        return rmq[a][0];
    else
    {
        int i=1;
        for (;a+(1<<i) <= b;i++);
        i--;

        int x=rmq[a][i];
        int y=funct_rmq(a+(1<<i),b);
        if (x<y) return x;
        else return y;
    }
}

int main()
{
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
    int m;
    scanf("%d %d\n",&n,&m);
    for (int i=1;i<=n;i++)
    {
        scanf("%d ",&numere[i]);
        rmq[i][0]=numere[i];
        if (i>=2)
            log[i]=log[i/2]+1;
    }
    for (int j=1; (1<<j) <= n;j++)
        for (int i=1;i+(1<<j)-1 <= n;i++)
        {
            if (rmq[i][j-1] < rmq[i+(1<<(j-1))][j-1])
                rmq[i][j]=rmq[i][j-1];
            else rmq[i][j]=rmq[i+(1<<(j-1))][j-1];
        }
    for (int i=1;i<=m;i++)
    {
        int a,b;
        scanf("%d %d\n",&a,&b);
        int k=log[b-a+1];
        int min=rmq[a][k];
        if (rmq[b-(1<<k)+1][k]<min)
            min=rmq[b-(1<<k)+1][k];
        printf("%d\n",min);
    }
}