#include <fstream>

using namespace std;

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

int n, m, a[100005], x, y, k;

int lg[100005];

int d[20][100005];

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

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

    lg[0] = -1;
    for (int i = 1; i <= n; i++)
    {
        lg[i] = lg[i/2] + 1;
    }

    for (int i = 1; i <= n; i++)
        d[0][i] = a[i];

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

    for (int i = 1; i <= m; i++)
    {
        f >> x >> y;

        if (y == x)
        {
            g << a[x] << '\n';
            continue;
        }
        k = lg[y-x];

        g << min(d[k][x], d[k][y-(1<<k)+1]) << '\n';
    }

    return 0;
}