#include <bits/stdc++.h>

using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
int n, m, a[100005], d[100005][30], x, y;

int logg(int x) {
    int ans = 0;
    while ((1 << (ans + 1)) <= x)
        ans++;

    return ans;
}
int main()
{
    in >> n >> m;
    for (int i = 1; i <= n; i++)
        in >> a[i];
    for (int i = 1; i <= n; i++)
        d[i][0] = a[i];

    for (int i = 1; (1 << i) <= n; i++)
        for (int j = 1; j + (1 << i) - 1 <= n; j++)
            d[j][i] = min(d[j][i - 1], d[j + (1 << (i - 1))][i - 1]);

    while (m--) {
        in >> x >> y;
        int l = y - x + 1;
        int lg = logg(l);
        int dif = l - (1 << lg);

        out << min(d[x][lg], d[x + dif][lg]) << '\n';
    }
    return 0;
}