#include <bits/stdc++.h>
using namespace std;

ifstream fin("rmq.in");
ofstream fout("rmq.out");
#define ll long long
const int maxn = 1e5;
int n, m;
int rmq[maxn + 2][18]; // minimul ce incepe de pe pozitia i si are lungime 1 << j
int lg[maxn + 2];
void read(){
    fin >> n >> m;
    for(int i = 0; i < n; ++i)
        fin >> rmq[i][0];
}
void preprocess(){
    for(int i = 2; i <= n; ++i)
        lg[i] = 1 + lg[i / 2];
    for(int j = 1; j <= lg[n]; ++j) // lungime 1 << j
        for(int i = 0; i + (1 << j) - 1 < n; ++i)
            rmq[i][j] = min(rmq[i][j - 1], rmq[i + (1 << (j - 1))][j - 1]);

}
int query(int x, int y){
    x--, y--;
    int len = lg[y - x + 1];
    return min(rmq[x][len], rmq[y - (1 << len) + 1][len]);
}
int main(){
    read();
    preprocess();
    for(int i = 1; i <= m; ++i){
        int x, y; fin >> x >> y;
        fout << query(x, y) << "\n";
    }
    return 0;
}
/*

*/