#include <fstream>
#include <iostream>
using namespace std;
int p[100001], rmq[17][100001];
ifstream fin ("rmq.in");
ofstream fout ("rmq.out");
int main()
{
    int n, q, i, j, k, x, y;
    fin >> n >> q;
    for (i = 1; i <= n; i++)
        fin >> rmq[0][i];
    p[1] = 0;
    for (i = 2; i <= 100000; i++)
        p[i] = p[i / 2] + 1;
    for (i = 1; i <= p[n]; i++)
        for (j = 1; j <= n - (1 << i) + 1; j++)
            rmq[i][j] = min (rmq[i - 1][j], rmq[i - 1][j + (1 << (i - 1))]);
    for (i = 1; i <= q; i++)
    {
        fin >> x >> y;
        k = p[y - x + 1];
        fout << min(rmq[k][x], rmq[k][y - (1 << k) + 1]) << "\n";
    }
    fout.close();
    return 0;
}