#include <iostream>
#include <fstream>

using namespace std;

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

void atribuire(int nod, int st, int dr, int poz, int val, int A[])
{
    int mij;
    if(st == dr)
    {
        A[nod] = val;
        return;
    }
    mij=(st+dr)/2;
    if(poz <= mij)
        atribuire(2*nod, st, mij, poz, val, A);
    else atribuire(2*nod+1, mij+1, dr, poz, val, A);
    A[nod]=min(A[2*nod], A[2*nod+1]);
}

void elmin(int nod, int st, int dr, int inceput, int sfarsit, int A[], int &minim)
{
    int mij;
    if(inceput <= st && dr <= sfarsit)
    {
        if(minim > A[nod])
            minim = A[nod];
        return;
    }
    mij=(st+dr)/2;
    if(inceput <= mij)elmin(2 * nod, st, mij, inceput, sfarsit, A, minim);
    if(mij < sfarsit)elmin(2 * nod + 1, mij + 1, dr, inceput, sfarsit, A, minim);
}

int main()
{
    int A[100001], N, M, i, operatie, inceput, sfarsit, elemente, poz, val, minim;
    f>>N>>M;
    for(i=1; i<=N; i++)
    {
        f>>elemente;
        atribuire(1, 1, N, i, elemente, A);

    }

    for(i=1; i<=M; i++)
    {

            f>>inceput>>sfarsit;
            minim=100001;
            elmin(1, 1, N, inceput, sfarsit, A, minim);
            g<<minim<<'\n';

    }

    return 0;
}