#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")

#include <bits/stdc++.h>

using namespace std;

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
#define ll long long int

const int inf=1e5+10;

vector<int> a(inf);

template<typename T>
struct rmq{
    vector<T> tr;
    void build(int l,int r,int v){
        if(l==r){
            tr[v]=a[r];
            return;
        }
        int mid=(l+r)/2;
        build(l,mid,2*v);
        build(mid+1,r,2*v+1);
        tr[v]=min(tr[2*v],tr[2*v+1]);
    }
    T query(int l,int r,int st,int end,int v){
        if(st>end)return inf;
        if(l==st && r==end)return tr[v];
        int mid=(l+r)/2;
        T t1=query(l,mid,st,min(mid,end),2*v);
        T t2=query(mid+1,r,max(st,mid+1),end,2*v+1);
        return min(t1,t2);
    }
};

vector<vector<int>> st(inf,vector<int> (18,0));

int main(){
    ifstream in("rmq.in");
    ofstream out("rmq.out");
    int n,m;
    in>>n>>m;
    for(int i=0;i<n;i++)in>>a[i];
    vector<int> lg(inf,0);
    for(int i=2;i<inf;i++)lg[i]=lg[i/2]+1;
    for(int i=1;i<=n;i++)st[i][0]=a[i-1];
    for(int j=1;j<=18;j++){
        for(int i=0;i+(1<<(j-1))<=n;i++){
            st[i][j]=min(st[i][j-1],st[i+(1<<(j-1))][j-1]);
        }
    }
    //debug(st[4]);
    //debug(st[5]);
    int l,r;
    while(m--){
        in>>l>>r;
        int j=lg[r-l+1];
        //debug(l,j,r-(1<<j)+1);
        //debug(st[l]);
        //debug(st[r-(1<<j)+1]);
        out<<min(st[l][j],st[r-(1<<j)+1][j])<<"\n";
    }
    return 0;
}