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

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

int n, Q;
int rmq[20][100005], lg[100005];

int main()
{
    int l, x, y;
    fin >> n >> Q;
    for (int i = 1; i <= n; i++)
        fin >> rmq[0][i];
    lg[1] = 0;
    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 << lg[i]) + 1; j++)
            rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + (1 << lg[i - 1])]);
    while (Q--)
    {
        fin >> x >> y;
        l = lg[y - x + 1];
        fout << min(rmq[l][x], rmq[l][y - (1 << l) + 1]) << "\n";
    }
    return 0;
}