//
//  main.cpp
//  RMQ
//
//  Created by Albastroiu Radu on 9/28/16.
//  Copyright © 2016 Albastroiu Radu. All rights reserved.
//

#include <fstream>
#include <algorithm>

using namespace std;

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

int n, m, a, b, ok, i, j;

struct element
{
    int x,y;
}v[100001];

int main()
{
    fin >> n >> m;
    
    for (i = 1; i <= n; i++)
    {
        fin >> v[i].x;
        v[i].y = i;
    }
    
    sort(v + 1, v + n + 1, [] ( element &a, element &b ) { return a.x < b.x; } );
    
    for (i = 1; i <= m; i++)
    {
        fin >> a >> b;
        
        for(j = 0;  ;j++)
        {
            if(v[j].y >= a && v[j].y <= b)
            {
                fout << v[j].x << '\n';
                break;
            }
        }
    }
    return 0;
}