#include <fstream>
#include <cmath>
#include <limits>
#include <iostream>
using namespace std;

int query(int x, int y, int a[], int dp[], int pieces, int pieceSize)
{
    int left = y, right = y, minim = numeric_limits<int>::max(), i;
    for (i = 0; i < pieces; i++)
    {
        if (i * pieceSize >= x && i * pieceSize + (pieceSize - 1) <= y)
        {
            minim = min(minim, dp[i]);
            if (left == y)
                left = i * pieceSize;
            right = i * pieceSize + (pieceSize - 1);
        }
    }

    for (i = x; i <= left; i++)
        minim = min(minim, a[i]);
    for (i = right; i <= y; i++)
        minim = min(minim, a[i]);

    return minim;
}
int main()
{
    int N, M, i, x, y;
    ifstream f("rmq.in");
    f >> N >> M;
    int pieceSize = sqrt(N), pieces;
    pieces = pieceSize;
    if (N % pieceSize != 0)
        pieces++;

    int dp[pieces], a[N], minim;
    f >> a[0];
    minim = a[0];

    for (i = 1; i < N; i++)
    {
        f >> a[i];
        if (i % pieceSize == 0)
        {
            dp[i / pieceSize - 1] = minim;
            minim = a[i];
        }
        else
            minim = min(a[i], minim);
    }
    dp[pieces - 1] = minim;

    ofstream g("rmq.out");
    for (i = 0; i < M; i++)
    {
        f >> x >> y;
        g << query(x - 1, y - 1, a, dp, pieces, pieceSize) << '\n';
    }

    g.close();
    f.close();
}