#include <iostream>
#include <fstream>
#define nl '\n'

using namespace std;

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

const int NMAX = 1e5+5, LGMAX = 18;

int n, q, rmq[LGMAX][NMAX], lg[NMAX];

int main()
{
    fin >> n >> q;
    lg[0] = -1;
    for (int i = 1; i <= n; i++)
    {
        fin >> rmq[0][i];
        lg[i] = lg[i/2]+1;
    }
    for (int p = 1; p <= lg[n]; p++)
        for (int i = 1; i+(1<<p)-1 <= n; i++)
            rmq[p][i] = min(rmq[p-1][i], rmq[p-1][i+(1<<(p-1))]);
    while (q--)
    {
        int low, high;
        fin >> low >> high;
        int pow = lg[high-low+1];
        fout << min(rmq[pow][low], rmq[pow][high-(1<<pow)+1]) << nl;
    }
    return 0;
}