#include <bits/stdc++.h>

using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
const int oo = INT_MAX;
int n,m,v[100005],b[100005],pref[100005],suf[100005];
int Log2[100005],rmq[15][6005];
int bucket = 0;
void build_rmq()
{
    for(int k=1;k<=Log2[bucket];k++)
    {
        for(int i=1;i<=bucket;i++)
        {
            rmq[k][i] = min(rmq[k-1][i],rmq[k-1][i+(1<<(k-1))]);
        }
    }
}
int query_rmq(int x, int y)
{
    if(x>y)
    {
        return oo;
    }
    int k = Log2[y-x+1];
    return min(rmq[k][x],rmq[k][y-(1<<k)+1]);
}
int query(int x, int y)
{
    if(b[x]!=b[y])
    {
        int Min = query_rmq(b[x]+1,b[y]-1);
        Min = min(Min,suf[x]);
        Min = min(Min,pref[y]);
        return Min;
    }
    int Min = oo;
   /* for(int i=x;i<=y;i++)
    {
        Min = min(Min,v[i]);
    }
    */
    return Min;
}
int get_bucket(int poz)
{
    return (poz+Log2[n]-1)/Log2[n];
}
int main()
{
    f>>n>>m;
    for(int i=2;i<=n;i++)
    {
        Log2[i] = 1 + Log2[i/2];
    }
    int Min = 0;
    for(int i=1;i<=n;i++)
    {
        f>>v[i];
        b[i] = get_bucket(i);
        if(b[i]!=b[i-1])
        {
            ++bucket;
            rmq[0][bucket-1] = Min;
            Min = v[i];
        }
        Min = min(Min,v[i]);
        pref[i] = Min;
    }
    rmq[0][bucket] = Min;
    Min = 0;
    for(int i=n;i>=1;i--)
    {
        if(b[i]!=b[i-1])
        {
            Min = v[i];
        }
        Min = min(Min,v[i]);
        suf[i] = Min;
    }
    build_rmq();
    for(int i=1;i<=m;i++)
    {
        int a,b;
        f>>a>>b;
        g<<query(a,b)<<'\n';
    }
    return 0;
}