#include <iostream>
#include <fstream>

using namespace std;

#define NMAX 100002
#define LMAX 18

int n, m, rmq[LMAX][NMAX], i, k, lg[NMAX];

int main()
{
    ifstream fin("rmq.in");
    ofstream fout("rmq.out");
    fin >> n >> m;

    lg[1] = 0;
    for(i = 2; i <= n; i++)
        lg[i] = lg[i/2] + 1;

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

    for(k = 1; (1 << k) <= n; k++)
        for(i = 1; i + (1 << k) - 1 <= n; i++)
            rmq[k][i] = min(rmq[k-1][i], rmq[k-1][i + (1 << (k-1))]);

    int p, x, y;
    for(i = 1; i <= m; i++)
    {
        fin >> x >> y;
        p = lg[y-x+1];
        fout << min(rmq[p][x], rmq[p][y - (1 << p) + 1]) << endl;
    }
    return 0;
}


/*#include <iostream>
#include <fstream>

using namespace std;

#define NMAX 100002
#define LMAX 18

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

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

int main()
{
    long i, j, l;
    fin >> n >> m;
    for(i = 1; i <= n; i++)
        fin >> a[i];

    lg[1] = 0;
    for(i = 2; i <= n; i++)
        lg[i] = lg[i/2] + 1;

    for(i = 1; i <= n; i++)
        rmq[0][i] = a[i];

    for(i = 1; (1<<i) <= n; i++)
    {
        for(j = 1; j + (1<<i) - 1 <= n; j++)
        {
            rmq[i][j] = min(rmq[i-1][j], rmq[i-1][j+(1<<(i-1))]);
        }
    }

    long int x,y,sh;

    for(i = 1; i <= m; i++)
    {
        fin >> x >> y;
        l = lg[y-x+1];
        fout << min(rmq[l][x], rmq[l][y + 1 - (1 << l)]) << endl;
    }
    return 0;
}*/