#include <bits/stdc++.h>
using namespace std;

ifstream f("rmq.in");
ofstream g("rmq.out");

const int N = 1e5 + 5;

int n, m, a, b, k, rmq[18][N];

int main()
{
    f >> n >> m;
    for (int i = 1; i <= n; i++) f >> rmq[0][i];
    for (int i = 1, p = 2; p <= n; i++, p *= 2){
        for (int j = 1; j + p - 1 <= n; j++)
            rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + p / 2]);
        k = i;
    }
    for (; m; m--){
        f >> a >> b;
        unsigned l = (b - a);
        l = 31 - __builtin_clz(l);
        g << min(rmq[l][a], rmq[l][b - (1 << l) + 1]) << '\n';
    }
    
    return 0;
}