#include <iostream>
#include <fstream>
#include <cstdlib>
#include <stack>
#include <cstring>

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

#define ll long long
#define pb push_back
const int NMax = 1e5 + 5;
const ll inf = 9e18 + 5;

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

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

        rmq[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) {
            rmq[i][p] = min(rmq[i][p-1],rmq[i + (1<<(p-1))][p-1]);
        }
    }

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

        int p = lg[b-a+1];
        int mn1 = rmq[a][p],
            mn2 = rmq[b - (1<<p) + 1][p];

        out<<min(mn1,mn2)<<'\n';
    }

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