#include <fstream>
using namespace std;
ifstream cin("rmq.in");
ofstream cout("rmq.out");
int inf = 999999999;
int n, m, aint[400000], op, a, b;
void makesegtree(int st, int dr, int node, int poz, int val)
{
    if (st == dr)
    {
        aint[node] = val;
        return;
    }
    int mij = (st + dr) / 2;
    if (poz <= mij)
        makesegtree(st, mij, node * 2, poz, val);
    else
        makesegtree(mij + 1, dr, node * 2 + 1, poz, val);
    aint[node] = min(aint[node * 2], aint[node * 2 + 1]);
}
int rmq(int st, int dr, int node, int a, int b)
{
    if (a <= st && b >= dr)
        return aint[node];
    int mij = (st + dr) / 2, r1 = inf, r2 = inf;
    if (a <= mij)
        r1 = rmq(st, mij, node * 2, a, b);
    if (b >= mij + 1)
        r2 = rmq(mij + 1, dr, node * 2 + 1, a, b);
    return min(r1, r2);
}
int main()
{
    cin >> n >> m;
    for(int i = 1; i <= n; i++)
    {
        cin >> a;
        makesegtree(1, n, 1, i, a);
    }
    for (int i = 1; i <= m; i++)
    {

        cin >> a >> b;
        cout << rmq(1, n, 1, a, b) << endl;
    }
    return 0;
}