#include <iostream>
#include <cstdio>
#define MAXN 100050
#define MAXLOG 20

using namespace std;

int a[MAXN], n, m;
int rm[MAXN][MAXLOG]; /// rm[i][j] minimum index in range [i, i + 2^j -1]
/// i.e a[rm[i][j]] is the actual minimum
int log[MAXN]; /// log[i] = log2(i);

void prepare()
{
    for (int i = 1; i <= n; i++)
        rm[i][0] = i;
    for (int j = 1; 1<<j <= n; j++)
        for (int i = 1; i+(1<<(j-1)) <= n; i++) {
            int sec = i+(1<<j-1);
            if (a[rm[i][j-1]] < a[rm[sec][j-1]])
                rm[i][j] = rm[i][j-1];
            else
                rm[i][j] = rm[sec][j-1];
        }
    int crt=1, pwr = 0;
    for (int i = 1; i <= MAXN; i++) {
        if (i >= crt<<1) crt <<= 1, pwr++;
        log[i] = pwr;
    }
}

/// inclusive interval
int getMinInRange(int st, int fn)
{
    int lglen = log[fn-st+1];
    int s1 = rm[st][lglen], s2 = rm[fn-(1<<lglen)+1][lglen];
    if (a[s1] < a[s2])
        return s1;
    return s2;
}

void debug()
{
    for (int i = 1; i <= n; i++)
        printf("%d ", a[rm[i][0]]);
    printf("\n");
    for (int j = 1; 1 << j <= n; j++, printf("\n"))
        for (int i = 1; i+(1<<(j-1)) <= n; i++)
            printf("%d ", a[rm[i][j]]);
}

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

    scanf("%d %d", &n, &m);
    for (int i = 1; i <= n; i++)
        scanf("%d", &a[i]);
    prepare();
    int st, fn;
    for (int i = 1; i <= m; i++) {
        scanf("%d %d\n", &st, &fn);
        printf("%d\n", a[getMinInRange(st, fn)]);
    }
    return 0;
}