#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];


void update(int nod,int st,int dr,int pos,int val)
{
    if(st==dr)
        v[nod]=val;
    else
    {
        int m=(st+dr)/2;
        if(pos<=m)
            update(left(nod),st,m,pos,val);
        else
            update(right(nod),m+1,dr,pos,val);

        v[nod]=min(v[left(nod)],v[right(nod)]);
    }
}


int query(int nod,int st,int dr,int a,int b)
{

    int m,x1=0,x2=0;
    if(a<=st && b>=dr)
        return v[nod];
    if(a>dr || b<st)
        return max_val;
        m=(st+dr)/2;
            x1=query(left(nod),st,m,a,b);
            x2=query(right(nod),m+1,dr,a,b);

        return min(x1,x2);
}



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

int main()
{
    cin >> n >> m;
    for(i=1;i<=n;i++)
    {
        cin >> val;
        update(1,1,n,i,val);
    }

    for(i=1;i<=m;i++)
    {
        cin >> a >> b;
        cout << query(1,1,n,a,b) << '\n';
    }



    return 0;
}