#include <fstream>
#include <algorithm>

using namespace std;

const int NMAX = 100007;
const int LMAX = 19;

ifstream cin("rmq.in");
ofstream cout("rmq.out");

int n, m;
int dp[LMAX][NMAX], Lg[NMAX];

int main() {
    cin >> n >> m;
    for(int i = 1; i <= n; ++i) {
        cin >> dp[0][i];
    }
    for(int i = 1; (1 << i) <= n; ++i) {
        for(int j = 1; j <= n - (1 << i) + 1; ++j) {
            dp[i][j] = min(dp[i - 1][j], dp[i - 1][j + (1 << (i - 1))]);
        }
    }
    Lg[1] = 0;
    for(int i = 2; i <= n; ++i) {
        Lg[i] = Lg[i / 2] + 1;
    }
    for(int i = 1; i <= m; ++i) {
        int a, b;
        cin >> a >> b;
        cout << min(dp[Lg[b - a + 1]][a], dp[Lg[b - a + 1]][b + 1 - (1 << Lg[b - a + 1])]) << "\n";
    }
    return 0;
}