#include <fstream>

using namespace std;

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

const int MAX = 1e5 + 1, LGMAX = 18;
int rmq[LGMAX][MAX], lg[MAX], n, m;

int main()
{
    cin >> n >> m;
    for(int i = 1; i <= n; ++i) {
        cin >> rmq[0][i];
    }

    for(int i = 2; i <= n; ++i) {
        lg[i] = 1 + lg[i / 2];
    }

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

    for(int i = 1; i <= m; ++i) {
        int s, d;
        cin >> s >> d;

        int lin = lg[d - s + 1];
        cout << min(rmq[lin][s], rmq[lin][d - (1<<lin) + 1]) << '\n';
    }

    return 0;
}