#include <bits/stdc++.h>
using namespace std;

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


int n, Q;
int rmq[19][100005], a[100005], e[100005];

void BuildRMQ()
{
    int i, j, L;
    e[1] = 0;
    for (i = 2; i <= n; i++)
        e[i] = 1 + e[i / 2];
    for (i = 1; i <= n; i++)
        rmq[0][i] = a[i];
    for (i = 1; i <= e[n]; i++)
    {
        L = (1 << (i - 1));
        for (j = 1; j <= n - 2 * L + 1; j++)
            rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + L]);
    }
}
int Query(int st, int dr)
{
    int expo, L;
    L = dr - st + 1;
    expo = e[L];
    L = (1 << expo);
    return min(rmq[expo][st], rmq[expo][dr - L + 1]);
}

int main()
{
    int x, y;
    fin >> n >> Q;
    for (int i = 1; i <= n; i++)
        fin >> a[i];
    BuildRMQ();
    while (Q--)
    {
        fin >> x >> y;
        fout << Query(x, y) << "\n";
    }
    return 0;
}