#include <iostream>
#include <fstream>
#include <vector>
#include <string.h>

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

#define ll long long
const int NMax = 1e5 + 5;

int N,M;
int v[NMax],lg[NMax],rmq[NMax][20];

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

    lg[1] = 0;
    rmq[1][0] = v[1];
    for (int i=2;i<=N;++i) {
        lg[i] = lg[i/2] + 1;
        rmq[i][0] = v[i];
    }

    for (int p=1;(1<<p) <= N;++p) {
        for (int i=1;i + (1<<p) - 1 <= N;++i) {
            int val1 = rmq[i][p-1],
                val2 = rmq[i+(1<<(p-1))][p-1];
            rmq[i][p] = min(val1,val2);
        }
    }

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

        int pw = lg[b-a+1],
            val1 = rmq[a][pw],
            val2 = rmq[b-(1<<pw)+1][pw];
        out<<min(val1,val2)<<'\n';
    }

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