//
// Created by Alex on 4/19/2022.
//

#include <bits/stdc++.h>

using namespace std;

const int NMAX = 100001;
int twoPower[25], v[NMAX], mat[25][NMAX], n, m;

int bin_search(int left, int right, int value){
    int solution = -1;

    while(left <= right){
        int mid = left + (right - left) / 2;
        if(twoPower[mid] <= value) solution = mid, left = mid + 1;
        else right = mid - 1;
    }

    return solution;
}

int main(){

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

//    ifstream f("D:/Proiecte/Clion/Projects/hashuri.in");
//    ofstream g("D:/Proiecte/Clion/Projects/hashuri.out");

    for(int i = 0; i < 25; ++i)
        twoPower[i] = (1 << i);

    f >> n >> m;

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

    int lg = bin_search(0, 24, n);

    for(int j = 1; j <= lg; ++j)
        for(int i = 0; i + (1 << j) <= n; ++i)
            mat[i][j] = min(mat[i][j - 1], mat[i + (1 << (j - 1))][j - 1]);

    for(int k = 1; k <= m; ++k){
        int left, right;
        f >> left >> right;

        --left; --right;

        int aux_lg = bin_search(0, 24, right - left + 1);
        g << min(mat[left][aux_lg], mat[right - (1 << aux_lg) + 1][aux_lg]) << '\n';
    }

    f.close();
    g.close();

    return 0;
}