#include <fstream>

using namespace std;

ifstream fin("rmq.in");
ofstream fout("rmq.out");

const int NMax = 1e5;

int RMQ[20][NMax + 5], N, M, Log2[NMax + 5];

int main()
{
    fin >> N >> M;

    for(int i = 1; i <= N; i++)
        fin >> RMQ[0][i];

    for(int i = 2; i <= N; i++)
        Log2[i] = Log2[i / 2] + 1;

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

    for(int i = 0, x, y; i < M; i++)
    {
        fin >> x >> y;

        int k = Log2[y - x + 1];

        fout << min(RMQ[k][x], RMQ[k][y - (1 << k) + 1]) << '\n';
    }
    fout.close();
    fin.close();

    return 0;
}