// https://goo.gl/fBmFxu
#include <bits/stdc++.h>
using namespace std;

#define NMAX        100009
#define LGMAX        21
#define MMAX        200009
#define kInf        (1 << 30)
#define kInfLL      (1LL << 60)
#define kMod        666013
#define edge pair<int, int>
#define x first
#define y second

#define USE_FILES "MLC"

#ifdef USE_FILES
#define cin fin
#define cout fout
ifstream fin("rmq.in");
ofstream fout("rmq.out");
#endif

// number of tests from "in"
int test_cnt = 1;
void clean_test();

// your global variables are here

// Binary Indexed Trees
template<typename T = int>
struct RMQ {
	int size;
	T& (*func)(T&, T&);

    vector<T> lg;
    vector<vector<T>> rmq;

	RMQ(int _size, vector<T> &v, T& (*_func)(T&, T&)) :
        size(_size),
        func(_func),
        lg(size + 1),
        rmq(LGMAX, vector<T>(size + 1)) {

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

        for (int i = 1; i <= n; ++i) {
            rmq[0][i] = v[i];
        }

        for (int k = 1; (1LL << k) <= n; ++k) {
            for (int i = 1; i <= n - (1 << k) + 1; ++i) {
                rmq[k][i] = func(rmq[k - 1][i], rmq[k - 1][i + (1 << (k - 1))]);
            }
        }
    }

  	T query(int i, int j) {
        if (i > j) {
            swap(i, j);
        }

        int k = lg[j - i + 1];
        return func(rmq[k][i], rmq[k][j - (1 << k) + 1]);
  	}
};

int& func_min(int &a, int &b) {
    return a <= b ? a : b;
}

int& func_max(int &a, int &b) {
    return a >= b ? a : b;
}

// your solution is here
void solve() {
    int n, Q;
    cin >> n  >> Q;

//     RMQ<int> aint(n + 1, func_min, numeric_limits<int>::max());

    vector<int> v(n + 1);
    for (int i = 1; i <= n; ++i) {
        cin >> v[i];
    }

    RMQ<int> rmq(n, v, func_min);


	while (Q--) {
		int start, end;
		cin >> start >> end;
        cout << rmq.query(start, end) << "\n";
	}

    if (test_cnt > 0) {
        clean_test();
    }
}


void clean_test() {
    // clean if needed
}


int main() {
//    cin >> test_cnt;
    while (test_cnt--) {
        solve();
    }

    return 0;
}