#include <bits/stdc++.h>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int n, m, x, y, i, st, dr, mi;
int rmq[18][1<<17];
int main()
{
    f >> n >> m;
    for(int i = 1; i <= n; i++)
        f >> rmq[0][i];
    x = 1, y = 2, i = 1;
    for(; y <= n; y<<=1, x<<=1, i++)
        for(st = 1, dr = y, mi = x + 1; dr <= n; st++, mi++, dr++)
            rmq[i][st] = min(rmq[i - 1][st], rmq[i - 1][mi]);
    for(; m; m--)
    {
        f >> x >> y;
        int lenght = y - x + 1;
        int line = 31 - __builtin_clz(lenght);
        int p = 1<<line;
        g << min(rmq[line][x], rmq[line][y - p + 1]) << '\n';
    }
    return 0;
}