#include <cstdio>
#include <iostream>

using namespace std;

int rmq[18][131071];

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];

    int log2N = 0;
    int p = 1;
    while(p <= N) ++ log2N, p += p;
    -- log2N;

    int step = 1;
    for(int i = 1; i <= log2N; ++ 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;
    }

    /*
    for(int i = 0; i <= log2N; ++ i)
    {
        for(int j = 1; j <= N; ++ j)
            cout << rmq[i][j] << ' ';
        cout << '\n';
    }
    cout << '\n';
    */

    while(M -- )
    {
        int a, b;
        cin >> a >> b;

        int d = b - a + 1;

        // cea mai mare putere a lui 2 mai mica decat d
        int log2d = 0;
        int p = 1;
        while(p <= d) ++ log2d, p += p;
        -- log2d;

        /*
        cout << log2d << ' ' << d << '\n';
        */

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

    return 0;
}