#include <bits/stdc++.h>

using namespace std;

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

const int inf = 1e9;

int n,a[100005],q,aint[400005];

void build(int nod,int l,int r)
{
    if (l == r)
        aint[nod] = a[l];
    else
    {
        int mij = (l + r) / 2;
        build(2 * nod,l,mij);
        build(2 * nod + 1,mij + 1,r);
        aint[nod] = min(aint[2 * nod],aint[2 * nod + 1]);
    }
}

int query(int nod,int l,int r,int st,int dr)
{
    if (r < st or dr < l)
        return inf;
    if (st <= l and r <= dr)
        return aint[nod];
    int mij = (l + r) / 2;
    return min(query(2 * nod,l,mij,st,dr),query(2 * nod + 1,mij + 1,r,st,dr));
}

int main()
{
    in >> n >> q;
    for (int i = 1; i <= n; i++)
        in >> a[i];
    build(1,1,n);
    for (int i = 1; i <= q; i++)
    {
        int l,r;
        in >> l >> r;
        out << query(1,1,n,l,r) << '\n';
    }
    return 0;
}