#include <bits/stdc++.h>

using namespace std;

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

const int Nmax = 1e5 + 2;

int n, m;
int lg[Nmax];
int rmq[20][Nmax];

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

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

    for(int i = 2; i <= n; i++)
        lg[i] = 1 + lg[i / 2];


    for(int p = 1; p <= lg[n]; p++)
        for(int i = 1; i <= n - (1 << p) + 1; i++)
            rmq[p][i] = min(rmq[p - 1][i], rmq[p - 1][i + (1 << (p - 1))]);

    int x, y, l;
    while(m--)
    {
        fin >> x >> y;
        l = lg[y - x + 1];
        fout << min(rmq[l][x], rmq[l][y - (1 << l) + 1]) << "\n";
    }

    fin.close();
    fout.close();
    return 0;
}