#include <iostream>
#include <fstream>
#include <cmath>
ifstream f("rmq.in");
ofstream g("rmq.out");
int v[100001][17];

int main(){

    int n, m, x, y, minim, p;
    f >> n >> m;

    for(int i = 1; i <= n; i++)
        f >> v[i][0];

    for(int p = 1; p < 17; p++)
        for(int i = 1; i + (1 << p) - 1 <= n; i++)
            v[i][p] = min(v[i][p - 1], v[i + (1 << (p - 1))][p - 1]);

    for(int i = 0; i < m; i++){
        f >> x >> y;

        int lungime = y - x + 1;
         p =  log2(lungime);

         minim = min(v[x][p], v[y - (1 << p) + 1][p]);
        g << minim <<  '\n';
    }
    return 0;
}