#include <stdio.h>
#include <algorithm>

using namespace std;

const int MAX = 100050;
const int LMAX = 19;

int rmq[LMAX][MAX], lg[MAX], n, m;

void formMatrice()
{
    for(int i = 2; i < MAX; i++) lg[i] = lg[i / 2] + 1;
    for(int i = 1; i <= lg[n]; i++)
        for(int j = 1; j + (1 << i) <= n + 1; j++)
            rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + (1 << (i - 1))]);
}

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", &rmq[0][i]);
    formMatrice();
    while(m--)
    {
        int a, b, dif, level;
        scanf("%d %d", &a, &b);
        dif = b - a + 1; level = lg[dif];
        if(dif != (1 << level))
            printf("%d\n", min(rmq[level][a], rmq[level][b - (1 << level) + 1]));
        else
            printf("%d\n", rmq[level][a]);
    }
    return 0;
}