#include <bits/stdc++.h>
#define INF 1000000000
using namespace std;

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

const int MaxN = (int)(1e5) + 5;

int r[32][MaxN];
int E[MaxN];

int n, m;

void gen_log(int n)
{
    E[1] = 0;
    for (int i = 2; i <= n; i++) E[i] = 1 + E[i / 2];
}

int main ()
{
    fin >> n >> m;
    gen_log(n);

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

    int j;
    for (int p = 1; (1 << p) <= n; p++)
        for (int i = 1; i <= n; i++)
        {
            r[p][i] = r[p - 1][i];
            j = i + (1 << p - 1);
            if ( (j <= n) && r[p][i] > r[p - 1][j])
                r[p][i] = r[p - 1][j];
        }

    int st, dr;
    int e, len;
    for (int i = 1; i <= m; i++)
    {
        fin >> st >> dr;
        e = E[dr - st + 1]; // e puterea lui 2 per juma' de interval
        len = (1 << e); //len lungime zona activa (de comparare?)
        fout << min(r[e][st], r[e][dr - len + 1]) << '\n';
    }
}