#include <fstream>
#include <iostream>
#include <cmath>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
#define NMAX 100005
int rmq[20][NMAX];
int main()
{
    int n, m;
    fin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        fin >> rmq[0][i];
    }
    for (int k = 1; (1 << k) <= n; k++)
    {
        for (int i = 1; i + (1 << k) - 1 <= n; i++)
        {
            int j = i + (1 << (k - 1));
            rmq[k][i] = min(rmq[k - 1][i], rmq[k - 1][j]);
        }
    }
    while (m--)
    {
        int a, b;
        fin >> a >> b;
        int l = log2(b - a + 1);
        fout << min(rmq[l][a], rmq[l][b - (1 << l) + 1]) << '\n';
    }
    return 0;
}