#include <bits/stdc++.h>

using namespace std;

const int NMAX = 100005;
const int LOGMAX = 20;
int N, M, rmq[LOGMAX][NMAX], lg[LOGMAX];

void BuildRMQ()
{
    for (int i = 2;i <= N;++i)
        lg[i] = lg[i >> 1] + 1;
    for (int p = 1;(1 << p) <= N;++p)
        for (int i = 1;i + (1 << p) < N;++i)
            rmq[p][i] = min(rmq[p - 1][i], rmq[p - 1][i + (1 << (p - 1))]);
}

int QueryRMQ(int x, int y)
{
    if (y < x)
        swap(x, y);
    int p = lg[y - x + 1];
    return min(rmq[p][x], rmq[p][y - (1 << p) + 1]);
}

int main()
{
    ifstream fin("rmq.in");
    ofstream fout("rmq.out");
    fin >> N >> M;
    for (int i = 1;i <= N;++i)
        fin >> rmq[0][i];
    for (int i = 1;i <= M;++i)
    {
        int x, y;
        fin >> x >> y;
        fout << QueryRMQ(x, y) << "\n";
    }
    fin.close();
    fout.close();
    return 0;
}