#include <fstream>
#include <vector>
#include <algorithm>
#include <cmath>

using namespace std;

const int LOG = 20;
const int MAXN = 100002;
int mins[LOG][MAXN];
int logs[MAXN];

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

    int n, m;
    fin >> n >> m;

    logs[0] = -1;
    for (int i = 1; i <= n; ++i)
    {
        int x;
        fin >> x;
        mins[0][i] = x;
        logs[i] = logs[i / 2] + 1;
    }

    for (int j = 1; (1 << j) <= n; ++j)
    {
        for (int i = 1; i + (1 << j) - 1 <= n; ++i)
        {
            mins[j][i] = min(mins[j - 1][i], mins[j - 1][i + (1 << (j - 1))]);
        }
    }

    for (int i = 1; i <= m; ++i)
    {
        int x, y;
        fin >> x >> y;
        int logz = logs[y - x + 1];

        fout << min(mins[logz][x], mins[logz][y + 1 - (1 << logz)]) << '\n';

    }

    return 0;
}