#include <bits/stdc++.h>
using namespace std;
ifstream fin ("rmq.in");
ofstream fout ("rmq.out");
int mt[100005][20];
int v[100005];
int N, M;
int main ()
{
    fin >> N >> M;
    for (int i = 1; i <= N; i++)
        fin >> v[i];
    for (int p = 1, j = 1; p <= N; p *= 2, j++)
    {

        for (int i = 1; i + p - 1 <= N; i++)
        {
            int mini = 0x3f3f3f;
            int poz = 0;
            for (int l = i; l <= i + p - 1; l++)
                if (v[l] < mini)
                    mini = v[l], poz = l;
            mt[i][j] = poz;
        }

    }
    for (int i = 1; i <= M; i++)
    {
        int a, b;
        fin >> a >> b;
        int p = 1;
        int j = 1;
        while (p * 2 <= b - a)
            p *= 2, j++;
        fout << min (v[mt[a][j]], v[mt[b - p + 1][j]]) << "\n";
    }

}