#include <bits/stdc++.h>

using namespace std;

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

int rmq[22][100005];
int e[100005];
int L[22];
int n, Q;

void Citire() {
    fin >> n >> Q;
    for(int i = 1; i <= n; i++)
        fin >> rmq[0][i];
}

void MakeE() {
    e[1] = 0;
    for(int i = 2; i <= n; i++)
        e[i] = e[i / 2] + 1;
}

void MakeL() {
    L[0] = 1;
    L[1] = 2;
    for(int i = 2; i <= 20; i++)
        L[i] = L[i - 1] * 2;
}

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

void Query() {
    int x, y;
    int expo, len;
    while(Q--) {
        fin >> x >> y;
        expo = e[y - x + 1];
        len = L[expo];
        fout << min( rmq[expo][x], rmq[expo][y - len + 1] ) << "\n";
    }
}

int main() {
    ios_base :: sync_with_stdio(0);
    fin.tie(0);
    fout.tie(0);

    Citire();
    MakeE();
    MakeL();
    RMQ();
    Query();

    fin.close();
    fout.close();
    return 0;
}