#include <iostream>
#include <cstdio>
using namespace std;

#define NMAX 100005
#define INFI 0x3f3f3f3f
#define LGMAX 18

int D[ LGMAX ][ NMAX ];
int LG[ NMAX ];

int main () {

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

    int n, m, i, j, k, ln, lg, ma, st, dr;

    scanf( "%d%d", &n, &m );
    for ( i = 1; i <= n; ++i ) scanf( "%d", &D[ 0 ][ i ] );
    for ( i = 2; i <= n; ++i ) LG[ i ] = LG[ i / 2 ] + 1;

    for ( i = 1; i <= LGMAX; ++i ) {
        k = 1 << i;
        for ( j = 1; j + k  - 1 <= n; ++j ) {
            D[ i ][ j ] = min( D[ i - 1 ][ j ], D[ i - 1 ][ j + k / 2  ] );
        }
    }

    while ( m-- ) {
        scanf( "%d%d", &st, &dr );
        lg = LG[ dr - st ];
        printf( "%d\n", min( D[ lg ][ st ], D[ lg ][ dr - ( 1 << lg ) + 1 ] ) );
    }

    return 0;
}