#include <iostream>
#include <fstream>

using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");

const int Nmax = 400005, oo = 1000005;
int n, m, a[Nmax], minim;

void Update(int nod, int left, int right, int pos, int x)
{
    if(left == right)
    {
        a[nod] = x;
        return;
    }
    int mid = (left+right)/2;
    if(pos <= mid) Update(2*nod,left,mid,pos,x);
    else Update(2*nod+1,mid+1,right,pos,x);
    a[nod] = min(a[2*nod],a[2*nod+1]);
}

void Min(int nod, int left, int right, int a1, int b)
{
    if(a1 <=left && b >= right)
    {
         minim = min(minim,a[nod]);
         return;
    }
    int mid = (left+right)/2;
    if(a1 <= mid) Min(2*nod,left,mid,a1,b);
    if(b > mid) Min(2*nod+1,mid+1,right,a1,b);
}

int main()
{
    f>>n>>m;
    for(int i = 1; i <= n; i++)
    {
        int x;
        f>>x;
        Update(1,1,n,i,x);
    }
    while(m--)
    {
        int x,y;
        f>>x>>y;
        minim = oo;
        Min(1,1,n,x,y);
        g<<minim<<'\n';
    }
    return 0;
}