#include <bits/stdc++.h>

using namespace std;

const int Nmax = 100000 + 10;

int n , m , i , L , R , k;
int Log[Nmax] , d[18][Nmax];

void makeRmq()
{
    int i , j;

    for (i = 2; i <= n; ++i) Log[i] = Log[i>>1] + 1;

    for (i = 1; i <= Log[n]; ++i)
        for (j = 1; j <= n - (1 << i) + 1; ++j)
            d[i][j] = min(d[i-1][j] , d[i-1][j+(1<<(i-1))]);
}

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", &d[0][i]);

    makeRmq();

    for (i = 1; i <= m; ++i)
    {
        scanf("%d %d", &L, &R); k = Log[R-L+1];
        printf("%d\n", min(d[k][L] , d[k][R-(1<<k)+1]));
    }

}