#include <bits/stdc++.h>

using namespace std;

const int MAXN = 100005;

int v[MAXN], dp[20][MAXN], logar[MAXN];

int main()
{
    ifstream fin("rmq.in");
    ofstream fout("rmq.out");
    int n, m;
    fin >> n >> m;
    for(int i = 1; i <= n; ++i)
        fin >> v[i];
    logar[1] = 0;
    dp[0][1] = v[1];
    for(int i = 2; i <= n; ++i){
        logar[i] = logar[i / 2] + 1;
        dp[0][i] = v[i];
    }
    for(int i = 1; (1 << i) <= n; ++i){
        for(int j = 1; j <= n - (1 << i) + 1; ++j)
            dp[i][j] = min(dp[i - 1][j], dp[i - 1][j + (1 << (i - 1))]);
    }
    int st, dr;
    while(m){
        fin >> st >> dr;
        int logdif = logar[dr - st + 1];
        fout << min(dp[logdif][st], dp[logdif][dr - (1 << logdif) + 1]) << "\n";
        m--;
    }
    return 0;
}