#include <bits/stdc++.h>
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define ll long long
#define sz size()

using namespace std;
/*const long long mod = 998244353;
long long fct[200005],invfct[200005],inv[200005];
long long put2[200005];
long long lgput (long long a, long long exp)
{
    long long rz=1;
    while(exp)
        if(exp&1)
            exp^=1,rz=rz*1LL*a%mod;
        else
            exp>>=1,a=a*1LL*a%mod;
    return rz;
}
long long cmb (long long n, long long k)
{
    if(n<k || k<0 || n<0)
        return 0;
    return fct[n]*1LL*invfct[k]%mod*1LL*invfct[n-k]%mod;
}
void init ()
{
    inv[1]=fct[0]=fct[1]=invfct[0]=invfct[1]=put2[0]=1,put2[1]=2;
    for(long long i=2;i<=200000;++i)
        put2[i]=put2[i-1]*2LL%mod,inv[i]=(mod-mod/i)*1LL*inv[mod%i]%mod,fct[i]=i*1LL*fct[i-1]%mod,invfct[i]=inv[i]*1LL*invfct[i-1]%mod;
}
long long v[200005];*/
//long long
const int inf=1<<30;
int v[100005],lg[100005],m[100005][20];
void solve()
{
    ifstream cin("rmq.in");
    ofstream cout("rmq.out");
    int n,q;
    cin>>n>>q;
    for(int i=0;i<n;i++)
    {
        cin>>v[i];
        if(i)
           lg[i]=1+lg[i/2];
    }
    for(int i=0;i<n;i++)
        m[i][0]=1;
    for(int j=1;(1<<j)<=n;j++)
    {
        for(int i=0;i+(1<<j)<=n;i++)
        {
            int x=m[i][j-1];
            int y=m[i+(1<<(j-1))][j-1];
            if(v[x]<=v[y])
               m[i][j]=x;
            else
                m[i][j]=y;
        }
    }
    while(q--)
    {
        int i,j;
        cin>>i>>j;
        --i,--j;
        int k=lg[j-i+1];
        int x=m[i][k];
        int y=m[j-(1<<k)+1][k];
        cout<<min(v[x],v[y])<<"\n";
    }
}
int main()
{
    solve();
    return 0;
}