#include <bits/stdc++.h>

using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
#define cin fin
#define cout fout
#define left(nod) (nod * 2)
#define right(nod) (nod * 2 + 1)
const int NMAX=1e5+50;
const int max_val=1e5+50;
int v[4*NMAX],A[4*NMAX];


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

        int m=(st+dr)/2;
            cons(st,m,left(nod));
            cons(m+1,dr,right(nod));
        A[nod]=min(A[left(nod)],A[right(nod)]);
}



int query(int nod,int st,int dr,int a,int b)
{
    if(a<=st && b>=dr)
        return A[nod];
    if(a>dr || b<st)
        return max_val;
        int m=(st+dr)/2;
        return min(query(left(nod),st,m,a,b),query(right(nod),m+1,dr,a,b));
}



int n,i,a,b,m,val,x;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n >> m;
    for(i=1;i<=n;i++)
    {
        cin >> v[i];
    }
    cons(1,n,1);
    for(i=1;i<=m;i++)
    {
        cin >> a >> b;
        cout << query(1,1,n,a,b) << '\n';
    }



    return 0;
}