#include <iostream>
#include <fstream>
using namespace std;
ifstream ka("rmq.in");
ofstream ki("rmq.out");
int n, mm, a[100005], m[300005], x, y;
int initialize(int i, int j, int node)
{
    if(i == j)
        m[node] = a[i];
    else
    {
        m[node] = min(initialize(i, (i+j)/2, 2*node), initialize((i+j)/2+1, j, 2*node+1));
    }
    return m[node];
}

int query(int i, int j, int nod_mic, int nod_mare, int nod)
{
    if(nod_mare < i || nod_mic > j)
        return -1;
    if(nod_mic >= i && nod_mare <= j)
        return m[nod];
    int p1 = query(i, j, nod_mic, (nod_mic + nod_mare)/2, 2*nod);
    int p2 = query(i, j, (nod_mic + nod_mare)/2+1, nod_mare, 2*nod+1);
    if(p1 == -1)
        return p2;
    if(p2 == -1)
        return p1;
    return min(p1, p2);
}
int main()
{
    ka >> n >> mm;
    for(int i = 1; i <= n; i++)
    {
        ka >> a[i];
    }
    initialize(1, n, 1);
    for(int i = 1; i <= mm; i++)
    {
        ka >> x >> y;
        ki << query(x, y, 1, n, 1) << '\n';
    }
}