#include <iostream>
#include <fstream>
using namespace std;

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

int rmq[18][100005], e[100005], n;

void makeE()
{
    for (int i = 2; i <= n; i++)
        e[i] = 1 + e[i / 2];
}

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

int getMin(int x, int y)
{
    int L = e[y - x + 1];
    return min(rmq[L][x], rmq[L][y - (1 << L) + 1]);
}

int main()
{
    int i, j, q;
    fin >> n >> q;
    for (i = 1; i <= n; i++)
        fin >> rmq[0][i];
    makeE();
    RMQ();
    while (q--)
    {
        fin >> i >> j;
        if (j < i) swap(i, j);
        fout << getMin(i, j) << "\n";
    }
    return 0;
}