#include<cstdio>
#include<algorithm>
#include<iostream>
using namespace std;
int n,m,i,j,a[28][100010],x,y,l,sol;
int main()
{
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(i=1;i<=n;i++) scanf("%d",&a[0][i]);
    for(i=1;(1<<i)<=n;i++)
    {
        for(j=1;j+(1<<i)-1<=n;j++)
        {
            a[i][j]=min(a[i-1][j],a[i-1][j+(1<<(i-1))]);
        }
    }
    for(;m;--m)
    {
        scanf("%d%d",&x,&y);
        l=y-x+1;
        for(i=0;(1<<i)<=l;i++); i--;
        for(j=0;j+(1<<i)+1<=l;j++);
        sol=min(a[i][x],a[i][x+j]);
        printf("%d\n",sol);
    }
    return 0;
}