#include <iostream>
#include <fstream>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int A[500000];
void update(int node, int left, int right, int poz, int val)
{
    if(left==right)
    {
        A[node]=val;
        return;
    }
    int mid=(left+right)/2;
    if(poz<=mid)
        update(2*node,left,mid,poz,val);
    else
        update(2*node+1,mid+1,right,poz,val);
    if(A[2*node]<=A[2*node+1])
        A[node]=A[2*node];
    else
        A[node]=A[2*node+1];
}
int query(int node, int left, int right, int a, int b)
{
    if(a<=left && right<=b)
        return A[node];
    int mid=(left+right)/2;
    int v1=100001;
    int v2=100001;
    if(a<=mid)
        v1=query(2*node,left,mid,a,b);
    if(b>mid)
        v2=query(2*node+1,mid+1,right,a,b);
    if(v1<=v2)
        return v1;
    else
        return v2;
}
int main()
{
    int n,m,a,b,x,i;
    f>>n>>m;
    for(i=1; i<=n; ++i)
    {
        f>>x;
        update(1,1,n,i,x);
    }
    for(i=1; i<=m; ++i)
    {
        f>>a>>b;
        g<<query(1,1,n,a,b)<<'\n';
    }
    return 0;
}