#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <utility>
#include <cmath>
#include <string>
#include <cstring>

using namespace std;

int main() {
    ifstream in("rmq.in");
    ofstream out("rmq.out");

    int n, m;
    in >> n >> m;
    vector<int> lg(n + 1, 0);
    for(int i = 2; i <= n; i ++)
        lg[i] = 1 + lg[i >> 1];
    vector<vector<int>> rmq(lg[n] + 1, vector<int> (n + 1, 0));
    for(int i = 1; i <= n; i ++)
        in >> rmq[0][i];

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

    while(m --) {
        int x, y;
        in >> x >> y;
        int dim = y - x + 1;
        int ans = min(rmq[lg[dim]][x], rmq[lg[dim]][y - (1 << lg[dim]) + 1]);
        out << ans << "\n";
    }

    return 0;
}