#include <bits/stdc++.h>
using namespace std;
int n,m,i,j,a[20][100010],Log[100010],k,l,r;
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<=n-(1<<i)+1; ++j)
            a[i][j]=min(a[i-1][j],a[i-1][j+(1<<(i-1))]);
    for(i=2; i<=n; ++i)
        Log[i]=Log[i/2]+1;
    for(i=1; i<=m; ++i)
    {
        scanf("%d%d",&l,&r);
        k=Log[r-l+1];
        printf("%d\n",min(a[k][l],a[k][r-(1<<k)+1]));
    }
    return 0;
}