#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

ifstream fin ("rmq.in");
ofstream fout("rmq.out");


int noduri[500000];


void inserare (int nod_curent, int s, int d, int poz, int elem)
{
    if(s > poz || d < poz)
    {
        return;
    }
    if(s == d)
    {
        noduri[nod_curent] = elem;
        return;
    }

        inserare(nod_curent*2, s, (s+d)/2, poz, elem);
        inserare(nod_curent*2 + 1, ((s+d)/2) + 1, d, poz, elem);
        noduri[nod_curent] = min( noduri[nod_curent*2], noduri[nod_curent*2 + 1]);

}


int minimum (int nod_curent, int s, int d, int int_s, int int_d)
{
    if(int_s > d || int_d < s)
    {
        return 1<<30;
    }
    if(int_s <= s && int_d >= d)
    {
        return noduri[nod_curent];
    }
    return min(minimum(nod_curent*2, s, (s+d)/2, int_s, int_d), minimum(nod_curent*2 + 1, (s+d)/2 + 1, d, int_s, int_d));
}

int main()
{

    int n, m, elem, par_1, par_2;
    fin >> n >> m;

    for (int i = 1; i <=n ; i++)
    {
        fin >> elem;
        inserare(1, 1, n, i, elem);
    }
    for (int i = 1; i<= m; i++)
    {
        fin>> par_1 >> par_2;
        fout<<minimum(1, 1, n, par_1, par_2)<<"\n";
    }

    return 0;
}