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

#define NMAX 100002
#define LMAX 18

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

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

int main()
{
    f >> n >> m;
    for (int i = 1; i <= n; i++) {
        f >> a[i];
    }

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

    lg[1] = 0;
    for (int i = 2; i <= n; i++) {
        lg[i] = lg[i / 2] + 1;
    }
    for (int i = 1; i <= m; i++) {
        int x, y;
        f >> x >> y;
        int k = lg[y - x + 1];

        g << min(rmq[k][x], rmq[k][y - (1 << k) + 1]) << '\n';
    }

    return 0;
}