#include <bits/stdc++.h>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
int n, m, v[30][100005], log22[100005];
int main()
{
    fin >> n >> m;
    for (int i = 1; i <= n; ++i)
    {
        fin >> v[0][i];
    }
    for (int i = 2; i <= n; ++i)
    {
        log22[i] = log22[i / 2] + 1;
    }
    for (int log = 1; log <= log22[n]; ++log)
    {
        for (int i = 1; i + (1 << log) - 1 <= n; ++i)
        {
            v[log][i] = min(v[log - 1][i], v[log - 1][i + (1 << (log - 1))]);
        }
    }
    for (int i = 1; i <= m; ++i)
    {
        int x, y;
        fin >> x >> y;
        int log = log22[y - x + 1];
        fout << min(v[log][x], v[log][y - (1 << log) + 1]) << "\n";
    }
    return 0;
}