#include <cstdio>
using namespace std;

int m[100001][20] ,v[100001],log[100001];

int minim (int a, int b)
{
    if(a<b)
        return a;
    else
        return b;
}

int main()
{
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
    int i,j,n,q;
    scanf("%d%d", &n, &q);
    for(i = 1; i <= n; i++)
    {
        scanf("%d",&v[i]);
        m[i][0] = v[i];
    }
    for(i = 1; i <= n; i++)
    {
        m[i][0] = v[i];
        for(j = 1; (1 << j) <= i; j++)
            m[i][j] = minim(m[i][j-1], m[i-(1<<(j-1))][j-1]);
    }
    log[1]=0;
    for(i=2; i<=n; i++)
        log[i]=1+log[i/2];
    int rez,a,b;
    for (i = 1; i <= q; i++)
    {
        scanf("%d%d",&a,&b);
        int k=log[b-a+1];
        rez=minim(m[b][k],m[a+(1<<k)-1][k]);

        printf("%d\n",rez);
    }
    return 0;

}