#include <cstdio>
#include <algorithm>
using namespace std;
const int NMAX = 100015;
const int BITS = 30;
int rmq[NMAX][BITS];
int p2[NMAX];

int main() {
    int n, m;
    freopen("rmq.in", "r", stdin);
    freopen("rmq.out", "w", stdout);
    scanf("%d%d", &n, &m);
    for(int i = 1; i <= n; i++) {
        scanf("%d", &rmq[i][0]);
    }
    p2[1] = 0;
    for(int i = 2; i <= n + 5; i++) {
        p2[i] = p2[i / 2] + 1;
    }
    for(int p = 1; p <= p2[n]; p++) {
        int nr = (1 << p);
        for(int i = 1; i <= n - nr + 1; i++) {
            rmq[i][p] = min(rmq[i][p - 1], rmq[i + nr / 2][p - 1]);
        }
    }
    for(int i = 1; i <= m; i++) {
        int x, y;
        scanf("%d%d", &x, &y);
        int p = p2[y - x + 1];
        int sol = rmq[x][p];
        sol = min(sol, rmq[y - (1 << p) + 1][p]);
        printf("%d\n", sol);
    }
    return 0;
}