#include <bits/stdc++.h>

using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
const int Nmax = 100000 + 5;
int n, m, rmq[20][Nmax], l[Nmax];
int main()
{
    fin >> n >> m;
    for(int i = 1; i <= n; ++i)fin >> rmq[0][i];

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

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

    for(int i = 1, a, b, len; i <= m; ++i)
    {
        fin >> a >> b;
        len = l[(b - a + 1)];
        fout << min(rmq[len][a], rmq[len][b - (1 << len) + 1]) << '\n';
    }
    return 0;
}