#include <bits/stdc++.h>
using namespace std;

int n, q;
int segt[400001];

void update(int elem, int node, int x, int y, int st, int dr) {
    if (x > dr || y < st) {
        return;
    }
    if (x <= st && y >= dr) {
        segt[node] = elem;
        return;
    }
    int mid = (st + dr) / 2;
    update(elem, 2 * node, x, y, st, mid);
    update(elem, 2 * node + 1, x, y, mid + 1, dr);
    segt[node] = min(segt[2 * node], segt[2 * node + 1]);
}

int query(int node, int x, int y, int st, int dr) {
    if (x > dr || y < st) {
        return 0x3f3f3f3f;
    }
    if (x <= st && y >= dr) {
        return segt[node];
    }
    int mid = (st + dr) / 2;
    int leftSubtree = query(2 * node, x, y, st, mid);
    int rightSubtree = query(2 * node + 1, x, y, mid + 1, dr);
    return min(leftSubtree, rightSubtree);
}

int main() {
    ifstream cin("rmq.in");
    ofstream cout("rmq.out");
    cin >> n >> q;
    memset(segt, 0x3f, sizeof(segt));
    for (int i = 1; i <= n; ++i) {
        int elem;
        cin >> elem;
        update(elem, 1, i, i, 1, n);
    }
    for (int i = 1; i <= q; ++i) {
        int x, y;
        cin >> x >> y;
        cout << query(1, x, y, 1, n) << "\n";
    }
}