#include<bits/stdc++.h>
#define Nmax 100005
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");

int v[Nmax];
int arb[Nmax * 4];
int N, M;
void build(int k, int left, int right)
{
    if(left == right)
    {
        arb[k] = v[left];
        return;
    }
    int mid = (left + right) / 2;
    build(k * 2, left, mid);
    build(k * 2 + 1, mid + 1, right);
    arb[k] = min(arb[k * 2], arb[k * 2 + 1]);
}
int minim = INT_MAX;
void query(int k, int left, int right, int Qleft, int Qright)
{
    if(Qleft <= left && Qright >= right)
    {
        if(minim > arb[k])
        {
            minim = arb[k];
        }
        return;
    }
    if(Qleft > right || Qright < left)
        return;
    int mid = (left + right) / 2;
    query(2 * k, left, mid, Qleft, Qright);
    query(2 * k + 1, mid + 1, right, Qleft, Qright);
}
void citire()
{
    fin>>N>>M;
    for(int i=1; i<=N; i++)
    {
        fin>>v[i];
    }
    build(1, 1, N);
    int a, b;
    for(int i=1; i<=M; i++)
    {
        fin>>a>>b;
        minim = INT_MAX;
        query(1, 1, N, a, b);
        fout<<minim<<"\n";
    }
}
int main()
{
    citire();
    return 0;
}