#include <fstream>

using namespace std;

ifstream fin("rmq.in");
ofstream fout("rmq.out");

const int LMAX = 18;
const int NMAX = 1e5 + 1;
int rmq[LMAX][NMAX], l[NMAX];

int main()
{
    int n, m;
    fin >> n >> m;
    for (int i = 1; i <= n; ++i)
    {
        if (i > 1)
            l[i] = l[i >> 1] + 1;
        fin >> rmq[0][i];
    }
    for (int i = 1; (1 << i) <= 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 left, right;

    while (m--)
    {
        fin >> left >> right;
        int i = l[(right - left + 1)];
        fout << min(rmq[i][left], rmq[i][right - (1 << i) + 1]) << '\n';
    }
    return 0;
}