#include <iostream>
#include <fstream>

using namespace std;

const int N = 1e5;

int rmq[17][N], lg[N];
int n;

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

int Query (int a, int b)
{
    if (a > b)
        swap(a, b);
    int k = lg[b - a + 1];
    return min(rmq[k][a], rmq[k][b - (1 << k) + 1]);
}

void Read_Solve()
{
    ifstream fin ("rmq.in");
    int q;
    fin >> n >> q;
    for (int i = 1; i <= n; ++i)
        fin >> rmq[0][i];
    Build_RMQ();
    ofstream fout ("rmq.out");
    while (q--)
    {
        int x, y;
        fin >> x >> y;
        fout << Query(x, y) << "\n";
    }
    fin.close();
    fout.close();
}

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