#include <fstream>
#include <iostream>

using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
#define NMAX 100001
int v[NMAX];
int rmq[20][NMAX];
int lg[NMAX];
int main()
{
    int n, m;
    fin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        fin >> rmq[0][i];
    }

    for (int k = 1; (1 << k) <= n; k++)
    {
        for (int i = 1; i <= n - (1 << k) + 1; i++)
        {
            rmq[k][i] = min(rmq[k - 1][i], rmq[k - 1][i + (1 << (k - 1))]);
        }
    }
    for (int i = 2; i <= n; i++)
    {
        lg[i] = lg[i / 2] + 1;
    }
    while (m--)
    {
        int a, b;
        fin >> a >> b;
        int l = lg[b - a + 1];
        fout << min(rmq[l][a], rmq[l][b - (1 << l) + 1]) << '\n';
    }
    return 0;
}