#include <bits/stdc++.h>
using namespace std;

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

int rmq[19][100005], e[100005], n, m;

int main()
{
    int i, j, L, exp;
    fin >> n >> m;
    for (i = 1; i <= n; i++)
        fin >> rmq[0][i];
    for (i = 2; i <= n; i++)
        e[i] = 1 + e[i / 2];
    for (i = 1; i <= e[n]; i++)
    {
        L = (1 << i);
        for (j = 1; j <= n - L + 1; j++)
            rmq[i][j] = min(rmq[i - 1][j],
                            rmq[i - 1][j + L / 2]);
    }

    while (m--)
    {
        fin >> i >> j;
        exp = e[j - i + 1];
        L = (1 << exp);
        fout << min(rmq[exp][i], rmq[exp][j - L + 1]) << "\n";
    }
    return 0;
}