#include <iostream>
#include <fstream>
using namespace std;

ifstream in("rmq.in");
ofstream out("rmq.out");

const int INF = 1e6;
const int MAXN = 1e5 + 5;
int n, m, v[MAXN], lg[MAXN];
int dp[17][MAXN];

void compute() {
    for (int i = 2; i <= n; ++i) lg[i] = lg[i/2] + 1;
    for (int j = 1; j <= n; ++j) dp[0][j] = v[j];

    for (int i = 1; i <= 16; ++i) {
        int step = 1 << (i - 1);
        for (int j = 1; j <= n - step; ++j) {
            dp[i][j] = min(dp[i - 1][j], dp[i - 1][j + step]);
        }
    }
}

int query(int l , int r) {
    if (l > r) return INF;
    int s = r - l + 1;
    if (s == 0) return v[l];
    int p = lg[s];
    return min(dp[p][l], dp[p][r - (1 << p) + 1]);
}

int main()
{
    in >> n >> m;
    for (int i = 1; i <= n; ++i) in >> v[i];
    compute();

    for (int i = 1, l, r; i <= m; ++i) {
        in >> l >> r;
        out << query(l, r) << "\n";
    }

    return 0;
}