#include <iostream>
#include <fstream>

using namespace std;

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

const int N_MAX = 1e5 + 5;
const int LOG_MAX = 20;

int N, M;
int x, y;

int Log[N_MAX];
int RMQ[LOG_MAX][N_MAX];

int Query(int x, int y)
{
    int len = y - x;
    return min(RMQ[Log[len]][x], RMQ[Log[len]][y - (1 << Log[len]) + 1]);
}

int main()
{
    fin >> N >> M;
    for (int i = 2; i <= N; i++) {
        Log[i] = Log[i / 2] + 1;
    }
    for (int i = 1; i <= N; i++) {
        fin >> x;
        RMQ[0][i] = x;
    }
    for (int i = 1; i <= Log[N]; i++) {
        for (int j = 1; j <= N; j++) {
            RMQ[i][j] = min(RMQ[i - 1][j], RMQ[i - 1][j + (1 << (i - 1))]);
        }
    }
    for (int i = 1; i <= M; i++) {
        fin >> x >> y;
        fout << Query(x, y) << "\n";
    }
    return 0;
}