#include <bits/stdc++.h>
#pragma GCC optimize ("Ofast")

using namespace std;

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

int n, rmq[17][100005];
int q, st, dr;

static inline int query(int j, int jj){
    int i = (int)log2(jj-j+1);
    jj -= (1<<i)-1;
    return min(rmq[i][j], rmq[i][jj]);
}

int main (){
    ios_base::sync_with_stdio(false);
    fin.tie(nullptr), fout.tie(nullptr);

    fin>>n>>q;

    for(int i=1; i<=n; i++)
        fin>>rmq[0][i];

    for(int i=1; (1<<i)<=n; i++)
        for(int j=1, jj; (jj=j+(1<<(i-1)))<=n; j++)
            rmq[i][j] = min(rmq[i-1][j], rmq[i-1][jj]);

    for(int i=0; (1<<i)<=n; i++, cout<<"\n")
        for(int j=1; j<=n; j++, cout<<" ")
            cout<<rmq[i][j];

    while(q--){
        fin>>st>>dr;
        fout<<query(st, dr)<<"\n";
    }
    return 0;
}