#include <iostream>
#include <fstream>
#include <tgmath.h>
using namespace std;

int v[100000], rmq[18][100000], N, M;

int main()
{
    ifstream fin("rmq.in");
    ofstream fout("rmq.out");
    int i,j,x,y;

    fin >> N >> M;
    for (i = 0; i < N; i++)
        fin >> v[i];

    int l = (int)log2(N);

    for (i = 0; i < N; i++)
        rmq[0][i] = v[i];

    for (i = 1; i <= l; i++)
        for (j = 0; j <= N - (int)pow(2,i); j++)
    {
        rmq[i][j] = min(rmq[i-1][j],rmq[i-1][j + (int)pow(2,i-1)]);
    }

    for (i = 0; i < M; i++)
    {
        fin >> x >> y;
        int k = (int)log2(y - x + 1);
        fout << min(rmq[k][x-1],rmq[k][y - (int)pow(2,k)]) << '\n';
    }

    fin.close();
    fout.close();
    return 0;
}