#include <cstdio>
#include <algorithm>

using namespace std;

int rmq[20][100010],log[100010];

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