#include <bits/stdc++.h>

using namespace std;

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

int rmq[20][100005];
int n, e[100005], Q;

void Citire()
{
    fin >> n >> Q;
    for(int i = 1; i <= n; i++)
        fin >> rmq[0][i];
}

void MakeE()
{
    e[1] = 0;
    for(int i = 2; i <= 100000; i++)
        e[i] = 1 + e[i / 2];
}

void RMQ()
{
    int L;
    for(int i = 1; i <= e[n]; i++)
    {
        L = (1 << i);
        for(int j = 1; j <= n - L + 1; j++)
              rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + L / 2]);
    }
}

void Rezolvare()
{
    MakeE();
    RMQ();
    int x, y, expo, L;
    while(Q--)
    {
        fin >> x >> y;
        expo = e[y - x + 1];
        L = (1 << expo);
        fout << min(rmq[expo][x], rmq[expo][y - L + 1]) << "\n";
    }
}

int main()
{
    Citire();
    Rezolvare();
    fin.close();
    fout.close();
    return 0;
}