#include <bits/stdc++.h>
using namespace std;
ifstream in ("rmq.in");
ofstream out ("rmq.out");
int v[100001];
int rmq[18][100001];
int logg[100001];
int n, m;
void preq ()
{
    logg[1] = 0;
    for (int i = 2;i<=100001;++i)
        logg[i] = logg[i/2] + 1;
    for (int i = 1; i<= n; ++i)
        rmq[0][i] = v[i];
    for (int i = 1; i<= 18; ++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))]);
}
int qr (int st, int dr)
{
    int lg = logg[dr - st + 1];
    return min(rmq[lg][st], rmq[lg][dr - (1<<lg) + 1]);
}
int main ()
{
    in >> n >> m;
    for (int i = 1;i<=n;++i)
        in >> v[i];
    preq();
    for (int i = 1;i<= m; ++i)
    {
        int a, b;
        in >> a >> b;
        out << qr (a,b) << '\n';
    }
    return 0;
}