#include <iostream>
#include <fstream>
#define NMAX 100005

using namespace std;

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

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

int intlog(int val)
{
    return 31 - __builtin_clz(val);
}

void precalculate()
{
    int logN = intlog(n);
    for (int i = 1; i <= logN; i++)
        for (int j = 0; j + (1 << (i - 1)) <= n; j++)
            rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + (1 << (i - 1))]);
}

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

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

    precalculate();

    for (int i = 1; i <= m; i++)
    {
        int x, y;
        fin >> x >> y;
        if (x > y)
            swap(x, y);

        int k = intlog(y - x + 1);
        fout << min(rmq[k][x], rmq[k][y - (1 << k) + 1]) << '\n';
    }

    return 0;
}