#include <bits/stdc++.h>
using namespace std;

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

const int NMAX = 1e5+5;
int arr[NMAX], segtree[NMAX*4], n, m, ans;

inline void update(int node, int st, int dr, int pos, int val)
{
    if(st == dr)
    {
        segtree[node] = val;
        return;
    }
    int mid = (st+dr)/2;
    if(pos <= mid)
        update(node*2, st, mid, pos, val);
    else
        update(node*2+1, mid+1, dr, pos, val);
    segtree[node] = min(segtree[node*2], segtree[node*2+1]);
}

inline void query(int node, int ArbSt, int ArbDr, int st, int dr)
{
    if(ArbDr < st || ArbSt > dr)
        return;
    if(ArbSt >= st && ArbDr <= dr)
    {
        ans = min(ans, segtree[node]);
        return;
    }
    int mid = (ArbDr + ArbSt)/2;
    query(node*2, ArbSt, mid, st, dr);
    query(node*2+1, mid+1, ArbDr, st, dr);
}

inline void solve()
{
    while(m--)
    {
        int a, b;
        fin >> a >> b;
        ans = INT_MAX;
        query(1,1,n,a,b);
        fout << ans << '\n';
    }
}

int main()
{
    fin >> n >> m;
    for(int i=1;i<=n;++i)
    {
        fin >> arr[i];
        update(1,1,n,i,arr[i]);
    }
    solve();
}