#include <bits/stdc++.h>
using namespace std;
ifstream fin ("rmq.in");
ofstream fout ("rmq.out");

int n, m, v[100001], rmq[18][100001], lg2[100001];

int query(int l, int r)
{
    if (l == r)
        return v[l];
    int p = lg2[r - l];
    return min(rmq[p][l], rmq[p][r - (1 << p)]);
}

int main()
{
    fin >> n >> m;
    for (int i = 1; i <= n; i++)
        fin >> v[i];

    lg2[1] = 0;
    for (int i = 2; i <= n; i++)
        lg2[i] = lg2[i / 2] + 1;
    for (int i = 1; i < n; i++)
        rmq[0][i] = min(v[i], v[i + 1]);
    for (int i = 1; i <= lg2[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))]);

    for (int i = 1; i <= m; i++)
    {
        int l, r;
        fin >> l >> r;
        fout << query(l, r) << '\n';
    }
    return 0;
}