/// RMQ (range minimum query)
/*
** rmq[2][2] = min(rmq[1][2], rmq[1][4]) (min pe bucati/jumatati)
** rmq[i][j] = min[j, j + 2 ^ i - 1] = min(rmq[i - 1][j], rmq[i -1][j + 1 << (i - 1)]);
** rmq[0][i] = a[i]
**
** In problema,pe intervalele date : [x, y], L = x - y + 1 ;  2 ^ i <= L, rmq[i][y - 1 << i + 1]
*/
/// arbori de intervale (Segment tree)

#include <iostream>
#include <fstream>

using namespace std;

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

/// log2 N : for (int i = 1; (1 << i) <= N; i++)

int     rmq[1000][1000], v[1000000], log[100000];
int     n, m;

/// log[X] - log2 X

void    make_log(void)
{
    log[1] = 0;
    for (int i = 2; i <= n; i++)
        log[i] = log[i / 2] + 1;
}

int     ft_min(int a, int b)
{
    return a <= b ? a : b;
}

int     query(int x, int y)
{
    int     i;

    i = log[y - x + 1];
    return  (ft_min(rmq[i][x], rmq[i][y - (1 << i) + 1]));
}

void    rezolvare(void)
{
    int     x;
    int     y;

    f >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        f >> v[i];
        rmq[0][i] = v[i];
    }
    for (int i = 1; (1 << i) <= n; i++)
    {
        for (int j = 1; j + (1 << i) - 1 <= n; j++)
            rmq[i][j] = ft_min(rmq[i - 1][j], rmq[i - 1][j + (1 << i) - 1]);
    }
    make_log();
    for (int i = 1; i <= m; i++)
    {
        f >> x >> y;
        g << query(x, y) << '\n';
    }
}
int main()
{
    rezolvare();
    return 0;
}