#include <cstdio>
#include <algorithm>

using namespace std;

const int Nmax = 100010;
const int LgMax = 18;

int n , m , left , right , i;
int Log[Nmax] , D[LgMax][Nmax];

void make_rmq()
{
    int i , j;
    for (Log[1] = 0, 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]);

    make_rmq();

    for (i = 1; i <= m; ++i)
    {
        scanf("%d %d", &left , &right); int ind = Log[right-left+1];
        printf("%d\n", min(D[ind][left] , D[ind][right-(1 << ind)+1]));
    }

    return 0;
}