#include <fstream>
#include <vector>
#include <iostream>
using namespace std;

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

#define NMAX 100002
#define LMAX 18

long int rmq[LMAX][NMAX];
long int n, m;
long int lg[NMAX];
long int a[NMAX];

int main()
{
    long int i, j, l;

    fin >> n >> m;

    for (i = 1; i <= n; i++)
        fin >> a[i];

    lg[1] = 0;
    for (i = 2; i <= n; i++)   ///  in ce putere se incadreaza restul, veti intelege dupa ce urmariti explicatiile 
        lg[i] = lg[i / 2] + 1;

    for (i = 1; i <= n; i++)
        rmq[0][i] = a[i];/// cel mai mic element din [i, i+ 2^0 - 1] adica [i, i] e chiar a[i]   
                        ///   (mereu vom parcurge i - 1 elemente deoarece prima casuta e locul de plecare )



    for (i = 1; (1 << i) <= n; i++) { // urmariti "Cum se calculeaza";
        l = 1 << (i - 1);
        for (j = 1; j <= n - (1 << i) + 1; j++)
            rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + l]);/// cel mai mic element din intervalul [j, j + 2^(i - 1) - 1] 
    }


    long int x, y, lungimeSegment, rest;

    for (i = 1; i <= m; i++) {
        fin >> x >> y;

        lungimeSegment = y - x + 1;
        l = lg[lungimeSegment]; ///urmariti explicatiile pe exemple 
        rest = lungimeSegment - (1 << l);
        fout << min(rmq[l][x], rmq[l][x + rest]) << "\n";
    }
    return 0;
}