#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <algorithm>
#include <bitset>
#include <cmath>
#include <queue>
#include <map>

using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
const int oo = 2e9;

int n, m, ans;
int rmq[20][100005], logg[100005];
int main()
{   

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

    for (int i = 2; i <= n; i++)
        logg[i] = logg[i / 2] + 1;

    for (int niv = 1; (1 << niv) <= n; niv++)
        for (int j = 1; j <= n - (1 << niv) + 1; j++)
            rmq[niv][j] = min(rmq[niv - 1][j], rmq[niv - 1][j + (1 << (niv - 1))]);

    while (m--) {
        int x, y;
        fin >> x >> y;
        int poz = logg[y - x + 1];
        fout << min(rmq[poz][x], rmq[poz][y - (1 << poz) + 1]) << '\n';
    }
    fin.close();
    fout.close();
    return 0;
}