#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>

using namespace std;

const int N = 100005;
const int LG = 18;

int n, m, log_n, a[N], st[N][LG];

int query(int l, int r) {
    int k = log_n - __builtin_clz(r - l + 1);
    return min(st[l][k], st[r - (1 << k) + 1][k]);
}

int main() {
    scanf("%d %d", &n, &m);
    log_n = log2(n);
    for (int i = 1; i <= n; i++) {
        scanf("%d", &a[i]);
        st[i][0] = a[i];
    }
    for (int j = 1; j <= log_n; j++)
        for (int i = 1; i + (1 << j) - 1 <= n; i++)
            st[i][j] = min(st[i][j - 1], st[i + (1 << (j - 1))][j - 1]);
    while (m--) {
        int l, r;
        scanf("%d %d", &l, &r);
        printf("%d\n", query(l, r));
    }
    return 0;
}