#include <fstream>
using namespace std;

#define floor_log2(msb, n) asm("bsrl %1, %0" : "=r"(msb) : "r"(n))
#define min(x, y) ((y) ^ (((x) ^ (y)) & -((x) < (y))))
#define IN_BUFFER_SIZE 0xE04DE0

__attribute__((always_inline)) size_t get_number()
{
    static char inBuffer[IN_BUFFER_SIZE];

    static size_t p = IN_BUFFER_SIZE - 0x1; size_t number = 0x0;

    inBuffer[p] > 0x2F || ++p != IN_BUFFER_SIZE || (fread(inBuffer, 0x1, IN_BUFFER_SIZE, stdin), p = 0x0);

    for(; inBuffer[p] > 0x2F;)
    {
        number = number * 0xA + inBuffer[p] - 0x30;

        ++p != IN_BUFFER_SIZE || (fread(inBuffer, 0x1, IN_BUFFER_SIZE, stdin), p = 0x0);
    }

    return number;
}

int n, m, k, RMQ[17][100001];

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

    n = get_number();

    m = get_number();

    for(int i = 1; i <= n; i++)

        RMQ[0][i] = get_number();

    for(int i = 0; i < 16; i++)

        for(int j = 1; j < n - i; j++)
        {
            int x = RMQ[i][j], y = RMQ[i][j + (1 << i)];

            RMQ[i + 1][j] = min(x, y);
        }

    while(m--)
    {
        int x = get_number(), y = get_number(), z;

        z = y - x + 1;

        floor_log2(k, z);

        int X = RMQ[k][x], Y = RMQ[k][y + 1 - (1 << k)];

        printf("%d\n", min(X, Y));
    }
}