#include <fstream>
#define inf 100001

using namespace std;

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

int n, m;
int x, y;
int poz, val;
int start, finish, minim;
int arb[131072];

void update(int nod, int st, int dr)
{
    if (st == dr)
    {
        arb[nod] = val;
        return;
    }

    int mij = (st + dr) / 2;
    if (poz <= mij)
        update(nod * 2, st, mij);
    else
        update(nod * 2 + 1, mij + 1, dr);

    arb[nod] = min(arb[nod * 2], arb[nod * 2 + 1]);
}

void query(int nod, int st, int dr)
{
    if (start <= st && dr <= finish)
    {
        minim = min(minim, arb[nod]);
        return;
    }

    int mij = (st + dr) / 2;
    if (mij >= start)
        query(nod * 2, st, mij);
    if (mij < finish)
        query(nod * 2 + 1, mij + 1, dr);
}

int main()
{
    f >> n >> m;
    for (int i=1; i<=n; i++)
    {
        f >> x;
        poz = i, val = x;
        update(1, 1, n);
    }

    while (m--)
    {
        f >> x >> y;
        minim = inf;
        start = x, finish = y;
        query(1, 1, n);
        g << minim << "\n";
    }

    return 0;
}