#include <fstream>
#include <iostream>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <stack>
#include <queue>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int rmq[100005][17],put[17];
int main() {
    int n,q;
    fin>>n>>q;
    for (int i=1; i<=n; i++)
        fin>>rmq[i][0];
    put[1]=0;
    for (int i=2; i<=n; i++)
        put[i]=put[i/2]+1;
    for (int j=1; j<=17; j++)
        for (int i=1; i+(1<<j)-1<=n; i++)
            rmq[i][j]=min(rmq[i][j-1],rmq[i+(1<<(j-1))][j-1]);
    while (q--) {
        int x,y;
        fin>>x>>y;
        int lg=put[y-x+1];
        fout<<min(rmq[x][lg],rmq[y-(1<<lg)+1][lg])<<"\n";
    }
    return 0;
}
// 2 0 3 -1 7 -4