#include <iostream>
#include <fstream>


using namespace std;

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

const int MAX= 100002;

int main() {
    int n, m, s, d;
    int minint[MAX][MAX], v[MAX] ;

    fin >> n >> m;
    for (int i = 1; i <= n; i++)
        fin >> v[i];
    for (int i = 1; i <= n; i++)
        minint[i][i] = i;
    for (int i = 1; i < n; i++)
        for (int j = i + 1; j <= n; j++)
            if (v[minint[i][j - 1]] < v[j])
                minint[i][j] = minint[i][j - 1];
            else
                minint[i][j] = j;
    for (int i = 0; i < m; i++)
    {
        fin >> s >> d;
        fout << v[minint[s][d]] << endl;

    }

    return 0;
}