#include <fstream>
#include <iostream>

using namespace std;

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

int tree[300000];

void update (int n, int l, int r, int p, int val)
{
    if (l == r)
    {
        tree[n] = val;
        return;
    }
    int m = (l + r) / 2;
    if (p <= m)
        update(2 * n, l, m, p, val);
    else
        update(2 * n + 1, m + 1, r, p, val);
    tree[n] = min(tree[2 * n], tree[2 * n + 1]);
}

int query (int n, int l, int r, int x, int y)
{
    if (l >= x && y >= r)
        return tree[n];
    int s, d;
    s = d = 1000001;
    int m = (l + r) / 2;
    if (x <= m)
        s = query(2 * n, l, m, x, y);
    if (y > m)
        d = query(2 * n + 1, m + 1, r, x, y);
    return min(s, d);
}

int main ()
{
    int n, m;
    fin >> n >> m;
    int i;
    for (i = 1; i <= n; ++i)
    {
        int x;
        fin >> x;
        update(1, 1, n, i, x);
    }

    for (i = 1; i <= m; ++i)
    {
        int x, y;
        fin >> x >> y;
        fout << query(1, 1, n, x, y) << '\n';
    }

    return 0;
}