#include <bits/stdc++.h>
using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");

int n, m, rmq[20][100005], a[100005], len[100005], L;
int main()
{
    int i, j, e, x, y;
    in >> n >> m;
    for(i = 1; i <= n; i++)
    {
        in >> a[i];
        rmq[0][i] = a[i];
    }
    len[1] = 0;
    for(i = 2; i <= n; i++)
        len[i] = 1 + len[i/2];
    for(i = 1; i <= len[n]; i++)
    {
        L = (1 << i);
        for(j = 1; j <= n - L + 1; j++)
            rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + L/2]);
    }
    for(i = 1; i <= m; i++)
    {
        in >> x >> y;
        e = len[y - x + 1];
        L = (1 << e);
        out << min(rmq[e][x], rmq[e][y - L + 1]) << "\n";
    }
    in.close();
    out.close();
    return 0;
}