#include <iostream>
#include <fstream>
#include <algorithm>
#define NMAX 100001
#define LMAX 18

using namespace std;

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

int A[NMAX], n, m;
int SP[LMAX][NMAX];
int lg[NMAX];

int main()
{
    in >> n >> m;
    for (int i = 1; i <= n; i++)
        in >> A[i];
    for (int i = 1; i <= n; i++)
        SP[0][i] = A[i];
    for (int i = 2; i <= n; i++)
        lg[i] = lg[i / 2] + 1;
    for (int j = 1; (1 << j) <= n; j++)
        for (int i = 1; i + (1 << j) - 1 <= n; i++)
            SP[j][i] = min(SP[j - 1][i], SP[j - 1][i + (1 << (j - 1))]);
    int x, y, z;
    for (int i = 1; i <= m; i++)
    {
        in >> x >> y;
        z = lg[y - x + 1];
        out << min(SP[z][x], SP[z][y - (1 << z) + 1]) << "\n";
    }
    in.close();
    out.close();
    return 0;
}