#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;

const int NMAX = 100001;
const int LOG = 20;

int m[NMAX][LOG];

int main()
{
    freopen("rmq.in", "r", stdin);
    freopen("rmq.out", "w", stdout);
    int n, i, j, q, st, dr;
    scanf("%d %d", &n, &q);

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

    // Construim matricea RMQ
    for (j = 1; (1 << j) <= n; j++)
    {
        for (i = 0; i + (1 << j) <= n; i++)
        {
            m[i][j] = min(m[i][j - 1], m[i + (1 << (j - 1))][j - 1]); // formula bazata pe randul trecut
        }
    }

    /*for (j = 0; (1 << j) <= n; j++)
    {
        for (i = 0; i + (1 << j) <= n; i++)
            printf("%d ", m[i][j]);
        printf("\n");
    }*/

    for (i = 0; i < q; i++)
    {
        scanf("%d %d", &st, &dr);
        st--;
        dr--;
        int log_query = log2(dr - st + 1);
        printf("%d\n", min(m[st][log_query], m[dr - (1 << log_query) + 1][log_query]));
    }
    return 0;
}