#include <iostream>
#include <fstream>

using namespace std;

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

int n,m,pos,st,dr,val,tree[400010],type,minim;

void update(int node, int left, int right)
{
    if(left==right)
    {
        tree[node]=val;
        return;
    }
    int mid=(left+right)/2;
    if(pos<=mid)
        update(2*node,left,mid);
    else
        update(2*node+1,mid+1,right);
    tree[node]=min(tree[2*node],tree[2*node+1]);
}

void query(int node, int left, int right)
{
    if(st<=left && right<=dr)
    {
        if(minim>tree[node])
            minim=tree[node];
        return;
    }
    int mid=(left+right)/2;
    if(st<=mid)
        query(2*node,left,mid);
    if(mid<dr)
        query(2*node+1,mid+1,right);
}

int main()
{
    fin >> n >> m;
    for(int i=1;i<=n;i++)
    {
        fin >> val;
        pos=i;
        update(1,1,n);
    }
    for(;m;--m)
    {
        fin >> st >> dr;
        minim=100005;
        query(1,1,n);
        fout << minim << '\n';
    }
    return 0;
}