#include <iostream>
#include <fstream>
#include <math.h>
#include <cstring>
using namespace std;

ifstream fin("rmq.in");
ofstream fout("rmq.out");

const int INF = 0x3f3f3f3f;
const int MAX_N = 100005;

int n, m;
int num[MAX_N];
int rmq[20][MAX_N];

void InitRMQ() {
    memset(rmq, INF, sizeof(rmq));
    for (int i = 0; i < n; i++) {
        rmq[0][i] = num[i];
    }
}

void BuildRMQ() {
    for (int e = 1; e < 20; e++) {
        int len = 1 << e;
        for (int lf = 0; lf + len <= n; lf++) {
            rmq[e][lf] = min(rmq[e - 1][lf], rmq[e - 1][lf + (1 << (e - 1))]);
        }
    }
}

int RMQQuery(int lf, int rg) {
    int len = log2(rg - lf + 1);
    return min(rmq[len][lf], rmq[len][rg - (1 << len) + 1]);
}

int main() {
    fin >> n >> m;
    for (int i = 0; i < n; i++) {
        fin >> num[i];
    }

    InitRMQ();
    BuildRMQ();

    for (int i = 0; i < m; i++) {
        int lf, rg;
        fin >> lf >> rg;

        fout << RMQQuery(lf - 1, rg - 1) << '\n';
    }
    
    return 0;
}