#include <fstream>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");

int n, m, i, j, x, y, k;
int d[20][100010], logDyn[100010];

int main()
{
    fin >> n >> m;
    for (i = 1 ; i <= n ; i++)
        fin >> d[0][i];
    for (i = 2 ; i <= 100010 ; i++)
        logDyn[i] = logDyn[i / 2] + 1;

    for (j = 1 ; (1 << j) <= n ; j++)
        for (i = 1 ; i + (1 << j) - 1 <= n ; i++)
            d[j][i] = min(d[j - 1][i], d[j - 1][i + (1 << (j - 1))]);

    for (i = 1 ; i <= m ; i++) {
        fin >> x >> y;
        k = logDyn[y - x];
        fout << min(d[k][x], d[k][y - (1 << k) + 1]) << '\n';
    }

    return 0;
}