#include <iostream>
#include <fstream>

std::ifstream in("rmq.in");
std::ofstream out("rmq.out");

#define MAX 100010
#define LOG 19

int sparseTable[LOG][MAX], n, m, x, y;

void buildST()
{
    for (int i = 0; i < n; i++)
        in >> sparseTable[0][i];
    for (int i = 1; i < LOG; i++)
        for (int j = 0; j - 1 + (1 << i) < n; j++)
            sparseTable[i][j] = std::min(sparseTable[i - 1][j], sparseTable[i - 1][j + (1 << (i - 1))]);
}

int minST(int x, int y)
{
    int log = 0;
    while (1 << (log + 1) <= y - x + 1)
        log++;
    return std::min(sparseTable[log][x], sparseTable[log][y - (1 << log) + 1]);
}

int main()
{
    in >> n >> m;
    buildST();
    for (int i = 0; i < m; i++)
    {
        in >> x >> y;
        x--;
        y--;
        out << minST(x, y) << '\n';
    }
    return 0;
}