#include <bits/stdc++.h>

using namespace std;

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

int n, m, v[200005];

void citire()
{
    in >> n >> m;
    for (int i=0; i<n; i++)
        in >> v[n+i];
}

void build()
{
    for (int i=n-1; i; i--)
        v[i]=min(v[i<<1],v[i<<1|1]);
}

int query(int l, int r)
{
    int s=2000000000;
    for (l+=n, r+=n; l<r; l>>=1, r>>=1)
    {
        if (l&1)
            s=min(s,v[l++]);
        if (r&1)
            s=min(s,v[--r]);
    }
    return s;
}

void op()
{
    int x, y;
    for (int i=1; i<=m; i++)
    {
        in >> x >> y;
        out << query(x-1,y) << '\n';
    }
}

void afis()
{
    for (int i=n; i<2*n; i++)
        out << v[i] << " ";
}

int main()
{
    citire();
    build();
    op();
    //afis();
    return 0;
}