#include <bits/stdc++.h>
using namespace std;
vector<int> tree;
int pos,a,b,mx,n,m,y;
void update(int x,int left,int right)
{
    if(left==right)tree[x]=y;
    else{
        int mid=(left+right)/2;
        if(pos<=mid)update(2*x,left,mid);
        else update(2*x+1,mid+1,right);
        tree[x]=min(tree[2*x],tree[2*x+1]);
    }
}
void query(int x,int left,int right)
{
    if(a<=left && b>=right)mx=min(tree[x],mx);
    else{
        int mid=(left+right)/2;
        if(a<=mid)query(2*x,left,mid);
        if(b>mid)query(2*x+1,mid+1,right);
    }
}
int main()
{
    freopen("rmq.in","r",stdin);
    freopen("rmq.out","w",stdout);
    scanf("%d%d",&n,&m);
    tree=vector<int>(4*n+1,99999999);
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&y);
        pos=i;
        update(1,1,n);
    }
    for(;m;m--)
    {
        scanf("%d%d",&a,&b);
        mx=999999999;
        query(1,1,n);
        printf("%d\n",mx);
    }
    return 0;
}