#include <iostream>
#include <fstream>
#include <stdio.h>
#include <queue>
#include <cstdlib>
#include <algorithm>
#include <iomanip>

#if 1
#define pv(x) cout<<#x<<" = "<<x<<"; ";cout.flush()
#define pn cout<<endl
#else
#define pv(x)
#define pn
#endif

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

#define ll long long
#define ull unsigned long long
#define pb push_back
#define mp make_pair
const int NMax = 1e5 + 5;
const int strMax = 1e7 + 5;

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

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

    in>>v[1];
    rmq[1][0] = v[1];
    lg[1] = 0;
    for (int i=2;i <= N;++i) {
        in>>v[i];
        rmq[i][0] = v[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) {
            int val1 = rmq[i][p-1],
                val2 = rmq[i + (1<<(p-1))][p-1];
            rmq[i][p] = min(val1,val2);
        }
    }

    while (M--) {
        int x,y;
        in>>x>>y;

        int pw = lg[y-x+1],
            val1 = rmq[x][pw],
            val2 = rmq[y-(1<<pw)+1][pw];

        out<<min(val1,val2)<<'\n';
    }

    return 0;
}