#include <cstdio>
#include <iostream>

#define NLen 131071
#define log2NLen 18

using namespace std;

int rmq[log2NLen][NLen];
int log2[NLen];
int pw[log2NLen];

inline int min(int a, int b)
{
    if(a < b) return a;
    return b;
}

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

    int M, N;
    cin >> N >> M;

    for(int i = 1; i <= N; ++ i) cin >> rmq[0][i];

    log2[1] = 0;
    for(int i = 2; i <= N; ++ i) log2[i] = log2[i / 2] + 1;
    pw[0] = 1;
    for(int i = 1; i < log2NLen; ++ i) pw[i] = pw[i - 1] * 2;

    int step = 1;
    for(int i = 1; i <= log2[N]; ++ i)
    {
        for(int j = 1; j <= N - step + 1; ++ j)
            rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + step]);
        step += step;
    }

    while(M -- )
    {
        int a, b;
        scanf("%d%d", & a, & b);

        int d = b - a + 1;

        int sol = min(rmq[ log2[d] ][a], rmq[ log2[d] ][ b - pw[ log2[d] ] + 1 ]);
        cout << sol << '\n';
    }

    return 0;
}