#include <fstream>

using namespace std;

ifstream f("rmq.in");
ofstream g("rmq.out");

int n, m;

int v[100001];

int lg[100001];

int rmq[100001][17];

void RMQ()
{
    for (int i = 2; i <= n; i++)
        lg[i] = lg[i / 2] + 1;

    for (int i = 1; i <= n; i++)
        rmq[i][0] = v[i];

    for (int i = 1; (1 << i) <= n; i++)
        for (int j = 1; j + (1 << i) - 1 <= n; j++)
            rmq[j][i] = min(rmq[j][i - 1], rmq[j + (1 << (i - 1))][i - 1]);
}

int query(int left, int right)
{
    int k = lg[right - left + 1];

    return min(rmq[left][k], rmq[right - (1 << k) + 1][k]);
}

int main()
{
    f >> n >> m;

    for (int i = 1; i <= n; i++)
        f >> v[i];

    RMQ();

    for (int i = 1; i <= m; i++)
    {
        int x, y; f >> x >> y;
        g << query(x, y) << "\n";
    }

    return 0;
}