#include <iostream>
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;

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

int rmq[18][300003];

int query (int s, int d){
    int p = 31 - __builtin_clz(d-s);
    return min(rmq[p][s], rmq[p][d - (1<<p)]);

}

int main()
{
    int n, m, s, d;
    int i, j;
    fin >> n >> m;
    for (i = 0; i < n; i++)
        fin >> rmq[0][i];

    for (i = 1; i <= 25; i++)
       for (j = 0; j + (1 << i) <= n; j++)
            rmq[i][j] = min(rmq[i-1][j], rmq[i-1][j + (1<<(i-1))]);



    for (i = 0; i < m; i++){
        fin >> s >> d;
        fout << query(s -1 , d ) << '\n';
    }
    return 0;
}