#include <fstream>
using namespace std;
ifstream cin("rmq.in");
ofstream cout("rmq.out");
int v[100005];
int sp[100005][1000];
int lg[100005];
void RMQ(int n)
{
    int i,j,k;
    for (i=0; i<n; i++)
        sp[i][0]=v[i];
    k=lg[n];
    for (j=1; j<=k; j++)
        for (i=0; (i+(1<<j))-1<n; i++)
            sp[i][j]=min(sp[i][j-1], sp[i+(1<<(j-1))][j-1]);
}
int query(int i, int j)
{
    int len=j-i+1;
    int k=lg[len];
    return min(sp[i][k], sp[i+len-(1<<k)][k]);
}
int main()
{
    int n,i,a,b,m;
    cin>>n>>m;
    for(i=0; i<n; i++)
        cin>>v[i];
    for(i=2; i<=100000; i++)
        lg[i]=1+lg[i/2];
    RMQ(n);
    for(i=1; i<=m; i++)
    {
        cin>>a>>b;
        cout<<query(a-1,b-1)<<'\n';
    }
    return 0;
}