#include <bits/stdc++.h>
const int NMAX = 1e5;
const int lgmax = 17;
using namespace std;
ifstream fin ("rmq.in");
ofstream fout ("rmq.out");
int arr[NMAX + 5], spt[lgmax][NMAX], lg2[NMAX + 5], n, q, st, dr;
void build(){
    for (int i = 1; i <= lg2[n]; i++)
        for (int j = (1 << i); j <= n; j++)
            spt[i][j] = min(spt[i - 1][j - (1 << (i - 1))], spt[i - 1][j]);
}
int query(int l, int r){
    int ordin = lg2[r - l + 1];
    int p = (1 << ordin);
    return min(spt[ordin][l + p - 1], spt[ordin][r]);
}
signed main(){
    fin >> n >> q;
    lg2[0] = -1;
    for (int i = 1; i <= n; i++)
         fin >> arr[i], spt[0][i] = arr[i], lg2[i] = lg2[i >> 1] + 1;
    build();
    while(q--)
        fin >> st >> dr, fout << query(st, dr) << "\n";
    return 0;
}