#include <fstream>

using namespace std;

int rmq[17][100005], lg[100005], n, m;

void CreateRMQ()
{
    int i, j;
    lg[1] = 0;
    for (i = 2; i <= n; i++)
        lg[i] = lg[i / 2] + 1;
    for (i = 1; i <= lg[n]; i++)
        for (j = 1; j <= n - (1 << i) + 1; j++)
            rmq[i][j] = min (rmq[i - 1][j], rmq[i - 1][j + (1 << (i - 1))]);
}

void Solve ()
{
    int i, x, y, k;
    ifstream fin ("rmq.in");
    ofstream fout ("rmq.out");
    fin >> n >> m;
    for (i = 1; i <= n; i++)
        fin >> rmq[0][i];
    CreateRMQ();
    for (i = 1; i <= m; i++)
    {
        fin >> x >> y;
        k = lg[y - x + 1];
        fout << min(rmq[k][x], rmq[k][y - (1 << k) + 1]) << "\n";
    }
}

int main()
{
    Solve();
    return 0;
}