#include <fstream>
#include <algorithm>
#define N 100010
using namespace std;

ifstream f("rmq.in");
ofstream g("rmq.out");

int n, m, start, stop, ok;
struct element
{
    int x, y;
}v[N];

bool verif (element a, element b)
{
    return a.x < b.x;
}

int main()
{
    f >> n >> m;
    for (int i = 1; i <= n; ++i)
    {
        f >> v[i].x;
        v[i].y = i;
    }

    sort(v + 1, v + n + 1, verif);

    for (int i = 1; i <= m; ++i)
    {
        f >> start >> stop;
        ok = 0;
        for (int j = 1; ok == 0; j++)
            if (v[j].y >= start && v[j].y <= stop)
            {
                ok ++;
                g << v[j].x << endl;
            }
    }
    return 0;
}