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

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

int rmq[18][100005], e[100005], n;

int Query(int x, int y)
{
    int L = y - x + 1;
    int exp = e[L];
    return min(rmq[exp][x], rmq[exp][y - (1 << exp) + 1]);
}

int main()
{
    int i, j, q;
    fin >> n >> q;
    for (i = 1; i <= n; i++)
        fin >> rmq[0][i];
    for (i = 2; i <= n; i++)
        e[i] = 1 + e[i / 2];
    for (i = 1; i <= e[n]; i++)
        for (j = 1; j <= n - (1 << i) + 1; j++)
            rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + (1 << (i - 1))]);
    while (q--)
    {
        fin >> i >> j;
        fout << Query(i, j) << "\n";
    }
    return 0;
}