#include <iostream>
#include <fstream>
#include <algorithm>
#include <cmath>


using namespace std;

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

int minint[18][100002], v[100002],lg[100002];

int main() {
    int n, m, s, d;
    

    fin >> n >> m;
    for (int i = 1; i <= n; i++)
        fin >> v[i];
    for (int i = 1; i <= n; i++)
        minint[0][i] = v[i];
    for (int i = 1; (1 << i) <= n; i++)
        for (int j = 1; j <= n - (1 << i) + 1; j++)
            minint[i][j] = min(minint[i - 1][j], minint[i - 1][j + (1 << (i - 1))]);
    lg[0] = 0;
    for (int i = 1; i <= n; i++)
        lg[i] = lg[i / 2] + 1;
    for (int i = 0; i < m; i++)
    {
        fin >> s>> d;
        int j = lg[d - s + 1];
        int z = d - s + 1 - (1 << j);
        fout << min(minint[j][s], minint[j][s + z]) << endl;
    }
    return 0;
}