#include <iostream>
#include <bits/stdc++.h>

using namespace std;

int v[100005], t[400005];

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

void build(int st, int dr, int nod)
{
    if (st == dr)
    {
        t[nod] = v[st];
        return;
    }

    int mij = st+(dr-st)/2;
    build(st, mij, nod*2);
    build(mij+1, dr, nod*2+1);
    t[nod] = min(t[2*nod], t[2*nod+1]);
}

void update(int nod, int st, int dr, int poz, int val)
{
    if(st==dr)
    {
        t[nod]+=val;
        return;
    }
    int mij = st+(dr-st)/2;
    int x2 = 2*nod;
    if(poz<=mij) update(x2,st,mij,poz,val);
    else update(x2+1,mij+1,dr,poz,val);
    t[nod] = t[x2] + t[x2+1];
}

int query(int nod, int st, int dr, int L, int R)
{
    if (L <= st && dr <= R)
        return t[nod];
    int ret = 100000;
    int mij = (st+dr)/2;
    int x2 = 2*nod;
    if(R>mij) ret = min(ret, query(x2+1,1+mij,dr,L,R));
    if(L<=mij) ret = min(ret, query(x2,st,mij,L,R));
    return ret;
}

int main()
{
    int n,m;
    f >> n >> m;
    for (int i = 0; i < n; ++i)
        f >> v[i+1];

    build(1,n,1);

    for (int i = 0; i < m; ++i)
    {
        int a, b;
        f >> a >> b;
        g << query(1,1,n,a,b) << '\n';
    }

    return 0;
}