#include <bits/stdc++.h>
#define Nmax 100010
#define Lmax 20
using namespace std;

ifstream f("rmq.in");
ofstream g("rmq.out");
int n, q, rmq[Nmax][Lmax], v[Nmax], nr2;

void read()
{
    f >> n >> q;
    for (int i = 1; i <= n; ++i) {
        f >> v[i];
    }
}

void constructRmq()
{
    for (int i = 1; i <= n; ++i)
        rmq[i][0] = v[i];

    for (int j = 1; 1 << j <= n; ++j) {
        for (int i = 1; i + (1 << j) - 1 <= n; ++i) {
            if (rmq[i][j - 1] < rmq[i + (1 << (j - 1))][j - 1])
                rmq[i][j] = rmq[i][j - 1];
            else
                rmq[i][j] = rmq[i + (1 << (j - 1))][j - 1];
        }
    }
}

int ask(int ls, int rs)
{
    int k = floor(log2(rs - ls + 1));
    return min(rmq[ls][k], rmq[rs - (1 << k) + 1][k]);
}

void solve()
{
    int x, y;
    for (int i = 1; i <= q; ++i) {
        f >> x >> y;
        g << ask(x, y) << "\n";
    }
}

int main()
{
    read();
    constructRmq();
    solve();
    return 0;
}