/*
 Author: 曹北健(37509)
 Result: AC Submission_id: 4303062
 Created at: Tue Apr 12 2022 22:11:37 GMT+0800 (China Standard Time)
 Problem: 5566  Time: 394   Memory: 1712
*/

#include <stdio.h>
#include <stdlib.h>
int a[8192] = { 0 }, b[8192] = { 0 };
int compare(const void *p, const void *q){
    int x = *(int *)p, y = *(int *)q;
    return (x > y) ? -1 : 1;
}
int main(){
    int n, m, l, r, i;
    scanf("%d%d", &n, &m);
    for(i = 1; i <= n; i++){
        scanf("%d", a + i);
    }
    while(m--){
        scanf("%d%d", &l, &r);
        memcpy(b, a + l, 4 * (r - l + 1));
        qsort(b, r - l + 1, 4, compare);
        printf("%d\n", b[2]);
    }
    return 0;
}