#include <bits/stdc++.h>

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

const int NMax = 100001;

int n,m,x,y,dif;
int rmq[20][NMax],LG[NMax];

int main()
{
    f >> n >> m;
    for(int i = 1; i <= n; ++i)
        f >> rmq[0][i];

    LG[1] = 0;
    for(int i = 2; i <= n; ++i)
        LG[i] = LG[i / 2] + 1;

    for(int i = 1; (1 << i) <= n; ++i){
        for(int j = 1; j + (1 << i) <= n + 3; ++j){
            rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + (1 << i - 1)]);
        }
    }
    for(int i = 1; i <= m; ++i){
        f >> x >> y;
        dif = y - x + 1;
        dif = LG[dif];
        g << min(rmq[dif][x],rmq[dif][y - (1 << dif) + 1]) << '\n';
    }

    return 0;
}