#include <bits/stdc++.h>

using namespace std;

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

int n, m, a[100005], x, y;
int p2[100005], rmq[21][100005];

void Rmq()
{
    p2[1] = 0;
    for(int i = 2; i <= n; i++)
        p2[i] = 1 + p2[i/2];
    for(int i = 1; i <= n; i++)
        rmq[0][i] = i;
    for(int i = 1; (1 << i) <= n; i++)
        for(int j = 1; j <= n - (1 << (i - 1)); j++)
            rmq[i][j] = min(a[rmq[i-1][j]], a[rmq[i-1][j + (1 << (i-1))]]);

}

int main()
{
    fin >> n >> m;
    for(int i = 1; i <= n; i++)
        fin >> a[i];
    Rmq();
    for(int i = 1; i <= m; i++)
    {
        fin >> x >> y;
        int p = p2[y - x + 1];
        int lg = (1 << p);
        fout << min(rmq[p][x], rmq[p][y - lg + 1]) << "\n";
    }
    return 0;
}