#include <bits/stdc++.h>

using namespace std;

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

const int LMAX = 20;

int main()
{
    int n, m;
    fin >> n >> m;

    vector<vector<int>> rmq(LMAX, vector<int>(n + 1));

    for (int i = 1; i <= n; ++i)
        fin >> rmq[0][i];

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

    while (m--)
    {
        int a, b;
        fin >> a >> b;

        int lg = 0;
        while ((1 << lg) <= b - a + 1)
            lg++;

        lg--;

        fout << min(rmq[lg][a], rmq[lg][b - (1 << lg) + 1]) << '\n';

    }

    return 0;
}