#include <iostream>
#include <fstream>

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

const int Nmax = 400005;
int n, A[Nmax], m, maxim;

void Query(int nod, int left, int right, int start, int finish)
{
    if(left >= start && right <= finish)
    {
        maxim = min(maxim, A[nod]);
        return;
    }
    int mid = (left+right)/2;
    if(mid >= start) Query(2*nod, left, mid, start, finish);
    if(mid < finish) Query(2*nod+1, mid+1, right, start, finish);
}

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

int main()
{
    int x,y;
    f>>n>>m;
    for(int i = 1 ; i <= 4*n; i++) A[i] = 10000000;
    for(int i = 1; i <= n; i++)
    {
        f>>x;
        Update(1,1,n,i,x);
    }
    for(int i = 1; i <= m; i++)
    {
        f>>x>>y;
        maxim = 10000000;
        Query(1,1,n,x,y);
        g<<maxim<<'\n';
    }
    return 0;
}