#include <iostream>
#include <fstream>
#include <cstdlib>
#include <ctime>
#include <deque>

using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");

#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define pb push_back
const int NMax = 1e5 + 5;
const int sMax = 1e3 + 5;
const int strMax = 7*NMax + 50;
const short inf = 1e9 + 5;

int N,M;
int v[NMax],rmq[sMax];

int main() {
    in>>N>>M;

    int root = 1;
    for (;root*root <= N;++root);
    --root;

    for (int i=1;i*root <= N;++i) {
        rmq[i] = inf;
    }

    for (int i=1;i <= N;++i) {
        in>>v[i];

        int idx = (i-1)/root + 1;
        rmq[idx] = min(rmq[idx],v[i]);
    }

    while (M--) {
        int a,b;
        in>>a>>b;

        int ans = inf, i = a;
        #define idx ((i-1)/root + 1)
        #define rem ((i-1)%root)
        while (i <= b && rem != 0) {
            ans = min(ans,v[i++]);
        }

        while (i+root-1 <= b) {
            ans = min(ans,rmq[idx]);
            i += root;
        }

        while (i <= b) {
            ans = min(ans,v[i++]);
        }

        out<<ans<<'\n';
    }

    in.close();out.close();
    return 0;
}