#include <cstdio>

using namespace std;

int dp[100005][32], log2[100005];

int minim(int a, int b) {
    if(a > b)
        return b;
    return a;
}

int main() {
    freopen("rmq.in", "r", stdin);
    freopen("rmq.out", "w", stdout);

    int n, m, x, y, k;
    scanf("%d%d", &n, &m);

    for(int i = 1; i <= n; ++ i) {
        scanf("%d", &dp[i][0]);
    }

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

    for(int i = 2; i <= n; ++ i) {
        log2[i] = log2[i / 2] + 1;
    }

    for(int i = 1; i <= m; ++ i) {
        scanf("%d%d", &x, &y);
        k = log2[y - x + 1];
        printf("%d\n", minim(dp[x][k], dp[y - (1 << k) + 1][k]));
    }

    return 0;
}