#include <bits/stdc++.h>

using namespace std;

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

int n, m, a[100005][20], v[100005], k;

void Citire()
{
    fin >> n >> m;
    for (int i = 0; i < n; i++)
        fin >> v[i];
}

int p2 (int x)
{
    return (1 << x);
}

void Preprocesare()
{
    k = log2(n) + 1;
    for (int i = 0; i < n; i++)
        a[i][0] = i;
    for (int j = 1; j < k; j++)
    {
        for (int i = 0; i < n; i++)
        {
            if (i + p2(j) - 1 < n)
            {
                if (v[a[i][j - 1]] <= v[a[i + p2(j - 1)][j - 1]])
                    a[i][j] = a[i][j - 1];
                else a[i][j] = a[i + p2(j - 1)][j - 1];
            }
        }
    }
}

void RMQ(int st, int dr)
{
    int lungime = dr - st + 1;
    int lg = log2(lungime);
    int dif = lungime - p2(lg);
    fout << min(v[a[st][lg]], v[a[st + dif][lg]]) << "\n";
}
// 1 2 3 4 5 6
void Query()
{
    for (int i = 1; i <= m; i++)
    {
        int st, dr;
        fin >> st >> dr;
        RMQ(st - 1, dr - 1);
    }
}

int main()
{
    Citire();
    Preprocesare();
    Query();
    return 0;
}