#include <cstdio>
#include <algorithm>

using namespace std;

int log2g[100001], dp[100001][17];

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

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

    log2g[1] = 0;
    for(int i = 2; i <= n; ++ i)
        log2g[i] = log2g[(int)i / 2] + 1;


    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 <= n - (1 << j) + 1; ++ i) {
            dp[i][j] = min(dp[i][j - 1], dp[i + (1 << j - 1)][j - 1]);
        }
    }

    int x, y, z;

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

    return 0;
}