#include <bits/stdc++.h>

using namespace std;
ifstream in("rmq.in");
ofstream out("rmq.out");
int v[100005][20],n,m;
int lg2(int x)
{
    int nr=0;
    while(x)
    {
        nr++;
        x/=2;
    }
    return nr-1;
}
int put(int x)
{
    if(x==1)
        return 2;
    else if(x==0)
        return 1;
    else
    {
        int aux=put(x/2);
        if(x%2)
            return aux*aux*2;
        else
            return aux*aux;
    }
}
int query(int i, int j)
{
    int nr=j-i+1;
    int h=lg2(nr);
    int l=put(h);
    int o=nr-l+i+1;
    return min(v[i][h],v[o][h]);
}
int main()
{
    in >> n >> m;
    for(int i=1; i<=n; i++)
    {
        in >> v[i][1];
    }
    int p=2,j=2;
    while(p<=n)
    {
        for(int i=1; i<=n-p+1; i++)
        {
            v[i][j]=min(v[i][j-1],v[i+p/2][j-1]);
        }
        p*=2;
        j++;
    }
    for(int i=1; i<=m; i++)
    {
        int x,y;
        in >> x >> y;
        out << query(x,y) << '\n';
    }
    return 0;
}