#include <bits/stdc++.h>
using namespace std;
const int nmax = 1e5;
const int lgmax = 17;

int v[nmax+5], rmq[nmax+5][lgmax+1], lg2[nmax+5];

//rmq[i][j] = minimul pe intervalul i ... i + 2^j - 1

int main() {
    ifstream f("rmq.in");
    ofstream g("rmq.out");

    int n,m; f >> n >> m;
    for(int i=1; i<=n; i++) {
        f >> v[i];
        rmq[i][0] = v[i];
    }
    for(int i=2; i<=n; i++) lg2[i] = lg2[i/2] + 1;
    for(int j=1; (1<<j)<=n; j++)
        for(int i=1; i<=n-(1<<j)+1; i++)
            rmq[i][j] = min(rmq[i][j-1], rmq[i+(1<<(j-1))][j-1]);
    for(int i=1; i<=m; i++) {
        int x,y; f >> x >> y;
        int len = y - x + 1;
        g << min(rmq[x][lg2[len]], rmq[y-(1<<lg2[len])+1][lg2[len]]) << "\n";
    }
    return 0;
}