#include <bits/stdc++.h>
	
 
	
 
	
using namespace std;
	
ifstream in("rmq.in");
	
ofstream out("rmq.out");
	
 
	
#define MAXN 1000005
	
#define MAXK 25
	
 
	
// sparse table
	
int st[MAXN][MAXK + 1], n, log_table[MAXN+1];
	
 
	
void build(const std::vector<int> &input) {
	
    for(int i = 0; i < n; ++i) {
	
        st[i][0] = input[i];
	
    }
	
 
	
 
	
    for (int j = 1; j <= MAXK; j++) {
	
        for (int i = 0; i + (1 << j) <= n; i++) {
	
            st[i][j] = std::min(st[i][j-1], st[i + (1 << (j - 1))][j - 1]);
	
        }
	
    }
	
 
	
 
	
    log_table[1] = 0;
	
    for (int i = 2; i <= MAXN; i++) {
	
        log_table[i] = log_table[i >> 1] + 1; 
	
    }
	
 
	
}
	
 
	
std::vector<int> rmq(const std::vector<int> &input,
	
                     const std::vector< std::pair<int, int> > &queries)
	
{
	
    n = input.size(); // input size
	
    std::vector<int> ans; // return vector
	
    ans.reserve(queries.size());
	
 
	
    build(input);
	
 
	
    for(std::pair<int, int> q : queries) {
	
        int left = q.first, right = q.second;
	
        int j = log_table[right - left + 1];
	
        int minimum = min(st[left][j], st[right - (1 << j) + 1][j]);
	
        ans.push_back(minimum);
	
    }
	
 
	
    return ans;
	
 
	
}
	
 
	
int main()
	
{
	
    int n, q;
	
    in >> n >> q;
	
    vector<int> input;
	
    input.reserve(n);
	
    vector<pair<int, int>> queries;
	
    queries.reserve(q);
	
    for(int i = 0; i < n; ++i) {
	
        int t;
	
        in >> t;
	
        input.push_back(t);
	
    }
	
 
	
    for(int i = 0; i < q; ++i) {
	
        int l, r;
	
        in >> l >> r;
	
        queries.push_back(make_pair(l - 1, r - 1));
	
    }
	
 
	
    vector<int> ans = rmq(input, queries);
	
 
	
    for(int i : ans) {
	
        out << i << "\n";
	
    }
	
 
	
}