#include <fstream>

using namespace std;

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

const int nmax = 1e5 + 1, lmax = 20;

int n, m;

int t[lmax][nmax], log2[nmax];

void citire()
{
    f >> n >> m;
    log2[0] = -1;

    for(int i = 1; i <= n; i++)
    {
        f >> t[0][i];
        log2[i] = log2[i >> 1] + 1;
    }
}

void rmq()
{
    for(int i = 1, lg = 2; lg <= n; ++i, lg <<= 1)
    {
        for(int j = 1; j + lg - 1 <= n; j++)
            t[i][j] = min(t[i - 1][j], t[i - 1][j + lg / 2]);
    }
}

int query(int x, int y)
{
    int k = log2[y - x + 1], lg = (1 << k);
    return min(t[k][x], t[k][y - lg + 1]);
}

int main()
{
    citire();
    rmq();
    int x, y;
    while(m--)
    {
        f >> x >> y;
        g << query(x, y) << "\n";
    }
    return 0;
}