#include <bits/stdc++.h>
 
using namespace std;
 
ifstream in("rmq.in");
ofstream out("rmq.out");
 
const int MAX_N = 100000;
const int MAX_K = log2(MAX_N);
 
int r[MAX_K + 1][MAX_N + 1];
 
int N, M, K;
 
int main()
{
    in >> N >> M;
 
    K = log2(N);
 
 
    for(int i = 1; i <= N; ++i)
        in >> r[0][i];
 
 
    for(int k = 1; k <= K; ++k)
        for(int i = 1; i <= N - (1 << k) + 1; ++i)
            r[k][i] = min(r[k - 1][i], r[k - 1][i + (1 << (k - 1))]);
 
 
    for(int i = 1; i <= M; ++i)
    {
        int x, y;
        in >> x >> y;
 
        int k = log2(y - x + 1);
 
        out << min(r[k][x], r[k][y - (1 << k) + 1]) << '\n';
    }
 
 
 
}