// O(sqrt(N)) for each query

#include <cstdio>
#include <cstring>

#include <algorithm>

using namespace std;

const int INF = 0x3f3f3f3f;
const int MAXN = 100001;
const int MAXSQ = 320;

int n;
int sqn;
int mins[MAXSQ];
int A[MAXN];

void preproc()
{
    for (int i = 0, j = 0; i < n; ++i) {
        if (i / sqn > j)
            ++j;
        mins[j] = min(mins[j], A[i]);
    }
}

int query(int x, int y)
{
    int lo = 0, hi;
    while (lo < x)
        lo += sqn;

    int res = INF;
    for (int i = x; i < lo; ++i)
        res = min(res, A[i]);
    hi = lo + sqn - 1;
    while (lo >= x && hi <= y) {
        res = min(res, mins[lo / sqn]);
        lo += sqn;
        hi = lo + sqn - 1; 
    }
    for (int i = lo; i <= y; ++i)
        res = min(res, A[i]);

    return res;
}

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

    int m;
    scanf("%d %d", &n, &m);
    for (int i = 0; i < n; ++i)
        scanf("%d", &A[i]);

    while (sqn * sqn < n)
        ++sqn;
    if (sqn * sqn != n)
        --sqn;

    memset(mins, 0x3f, sizeof(mins));
    preproc();

    for (int i = 0; i < m; ++i) {
        int x, y;
        scanf("%d %d", &x, &y);
        printf("%d\n", query(x - 1, y - 1));
    }

    return 0;
}