#include <iostream>
#include <fstream>
#include <vector>
#include <climits>
#include <queue>

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

const int NMax = 1e5 + 5;
const int inf = 1e9;

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

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

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

        mn[i][0] = v[i];
    }

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

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

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

        int p = lg[b-a+1];
        int val = min( mn[a][p],mn[b - (1<<p) + 1][p] );

        out<<val<<'\n';
    }

    return 0;
}