#include <bits/stdc++.h>
#define lim 100005
#define maxx 1000000000
using namespace std;

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

int n, m, v[lim], q[lim];

void read()
{
    in>>n>>m;
    for(int i=0;i<n; ++i)
    {
        in>>v[i];
    }
}

int create_rmq_tree(int inc, int sf, int pos)
{
    if(inc==sf)
    {
        q[pos]=v[inc];
        return 0;
    }
    int mid=(inc+sf)/2;
    create_rmq_tree(inc, mid, 2*pos+1);
    create_rmq_tree(mid+1, sf, 2*pos+2);
    q[pos]=min(q[2*pos+1], q[2*pos+2]);
}

int minimum(int inc, int sf, int iinc, int isf, int pos)
{
    if(iinc<=inc && isf>=sf)
        return q[pos];
    if(isf<inc || iinc>sf)
        return maxx;
    int mid=(inc+sf)/2;
    return min(minimum(inc, mid, iinc, isf, 2*pos+1), minimum(mid+1, sf, iinc, isf, 2*pos+2));

}

void solve()
{
    create_rmq_tree(0, n-1, 0);
    int x, y;
    for(int i=1; i<=m; ++i)
    {
        in>>x>>y;
        out<<minimum(0, n-1, x-1, y-1, 0)<<'\n';
    }
}

int main()
{
    read();
    solve();
    return 0;
}