#include <iostream>
#include <fstream>
using namespace std;
ifstream f("rmq.in");
ofstream g("rmq.out");
int x, y, rmq[1000000], n, m;
void update(int n, int left, int right, int pas, int val)
{
    if(left == right)
    {
        rmq[n] = val;
        return;
    }

    int mid = (left + right) / 2;
    if(pas <= mid)
        update(2*n, left, mid, pas, val);
    else
        update(2*n + 1, mid + 1, right, pas, val);
    rmq[n] = min(rmq[2*n], rmq[2*n + 1]);
}
int query(int n, int left, int right, int a, int b)
{
    int v1 = 100001, v2 = 100001;
    if(a <= left && right <= b)
    {
        return rmq[n];
    }
    int mid = (left + right) / 2;
    if(a <= mid)
        v1 = query(2 * n, left, mid, a, b);
    if(b > mid)
        v2 = query(2 * n + 1, mid + 1, right, a, b);
    return min(v1, v2);
}
int main()
{
    f>>n>>m;
    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;
        g<<query(1, 1, n, x, y)<<'\n';
    }
    return 0;
}