#include <bits/stdc++.h>

using namespace std;

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

int n, m, a[100005], rmq[20][100005], p2[100005];

///rmq[i][j] - valoarea minima a intervalului de lungime 2 ^ i care se termina la pozitia j
///p2[i] exp maxim a.i. 2^i <= i

void RMQ(){
    for(int p = 1; (1 << p) <= n; p++)
        for(int i = 1; i + (1 << (p - 1)) <= n; i++)
            rmq[p][i] = min(rmq[p-1][i], rmq[p-1][i + (1 << (p-1))]);
}

int main()
{
    int x, y;
    fin >> n >> m;
    for(int i = 1; i <= n; i++){
        fin >> a[i];
        rmq[0][i] = a[i];
        if(i > 1)
            p2[i] = p2[i/2] + 1;
    }
    RMQ();
    for(int i = 1; i <= m; i++){
        fin >> x >> y;
        int p = p2[y - x + 1];
        fout << min(rmq[p][x], rmq[p][y - (1 << p) + 1]) << "\n";
    }
    return 0;
}