#include <bits/stdc++.h>

using namespace std;

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

int n, m, p2[100003], rmq[20][100003];

int main()
{
    int x, y, e;
    fin >> n >> m;
    for (int i = 1; i <= n; i++)
        fin >> rmq[0][i];

    for (int i = 2; i <= n; i++)
        p2[i] = p2[i / 2] + 1;
    for(int i = 1; (1 << i) <= 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; i <= m; i++)
    {
        fin >> x >> y;
        e = p2[y - x + 1];
        fout << min(rmq[e][x], rmq[e][y - (1 << e) + 1]) << "\n";
    }
    return 0;
}