#include <fstream>
#include <iostream>

using namespace std;

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

const int N = 100001;
int n, m, x, y, l, dif, shift;
int lg[N], a[N];
int rmq[18][N];

int main()
{
    fin >> n >> m;
    for (int i = 1; i <= n; i++)
        fin >> a[i];
    for (int i = 2; i <= n; i++)
        lg[i] = lg[i / 2] + 1;
    for (int i = 1; i <= n; i++)
        rmq[0][i] = a[i];

    for (int i = 1; (1<<i) <= n; 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))]);
        }

    for (int i = 1; i <= m; i++)
    {
        fin >> x >> y;
        dif = y - x + 1;
        l = lg[dif];
        shift = dif - (1 << l);
        fout << min(rmq[l][x], rmq[l][x + shift]) << '\n';
    }
}