#include <bits/stdc++.h>
using namespace std;
#define MAXN 100001
int rmq[20][MAXN],lg[MAXN],n,Q;

void __init(){
    for(int i = 1;(1<<i)<=n;i++){
        for(int j = 1;j+(1<<(i-1))<=n;j++){
            rmq[i][j] = min(rmq[i-1][j], rmq[i-1][j + (1<<(i-1))]);
        }
    }
    lg[1] = 0;
    for(int i = 2;i<=n;i++){
        lg[i] = 1 + lg[i/2];
    }
}
int main(void){
    ofstream cout("rmq.out");
    ifstream cin("rmq.in");
    cin >> n>> Q;
    for(int i = 1;i<=n;i++)cin >> rmq[0][i];
    __init();
    while(Q--){
        int x, y, e, len;
        cin >> x >> y;
        e = lg[y - x + 1];
        len = (1<<e);
        cout << min(rmq[e][x], rmq[e][y - len + 1]) << '\n';
    }
}