#include <bits/stdc++.h>

using namespace std;

int dp[21][100005];
int lg[100005];

signed main()
{
    ifstream fin("rmq.in");
    ofstream fout("rmq.out");
    int n, m;
    fin >> n >> m;
    lg[1] = 0;
    for (int i = 1; i <= n; ++i) {
        fin >> dp[0][i];
        if (i >= 2) lg[i] = lg[i / 2] + 1;
    }
    for (int i = 1; i <= 20; ++i) {
        for (int j = 1; j <= n; ++j) {
            if (j + (1 << (i - 1)) <= n) {
                dp[i][j] = min(dp[i - 1][j], dp[i - 1][j + (1 << (i - 1))]); // 2 ^ (i - 1)
            } else {
                dp[i][j] = dp[i - 1][j];
            }
        }
    }
    for (int i = 1; i <= m; ++i) {
        int st, dr;
        fin >> st >> dr;
        int power = lg[dr - st + 1];
        fout << min(dp[power][st], dp[power][dr - (1 << power) + 1]) << '\n';
    }
}