# include <cstdio>
# include <algorithm>
# define N 100001
# define L 20

using namespace std;

int n,m,x,y,k;
int a[N],lg[N];
int rmq[L][N];

int main()
{
    freopen("rmq.in", "r", stdin);
    freopen("rmq.out", "w", stdout);

    scanf("%d %d\n", &n, &m);
    for(int i=1; i<=n; ++i)
        scanf("%d", &a[i]),rmq[0][i]=a[i];

    for(int i=2; i<=n; ++i)
        lg[i]=lg[i/2]+1;

    for(int i=1; i<=lg[n]; ++i)
        for(int j=1; j<=n-(1<<i)+1; ++j)
            rmq[i][j]=min(rmq[i-1][j],rmq[i-1][j+(1<<(i-1))]);

    for(int i=1; i<=m; ++i)
    {
        scanf("%d %d\n", &x, &y);
        k=lg[y-x+1];
        printf("%d\n", min(rmq[k][x],rmq[k][y-(1<<k)+1]));
    }
}