#include <bits/stdc++.h>
using namespace std;
ifstream fin  ("rmq.in");
ofstream fout ("rmq.out");
int rmq[100005][18];
int n, q, x, y;
int main (){
    fin>>n>>q;
    for(int i=1; i<=n; i++)
        fin>>rmq[i][0];
    for(int j=1; (1<<j)<=n; j++)
        for(int i=1; i<=n; i++){
            rmq[i][j] = rmq[i][j-1];
            if(i+(1<<(j-1)) <= n)
                rmq[i][j] = min(rmq[i][j], rmq[i+(1<<(j-1))][j-1]);
        }
    int x, y, z;
    while(q--){
        fin>>x>>y;
        if(x > y)
            swap(x, y);
        z = (int)log2(y-x+1);
        fout<<min(rmq[x][z], rmq[y-(1<<z)+1][z])<<"\n";
    }
    return 0;
}