#include <iostream>
#include <fstream>

using namespace std;

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

const int NMAX = 100000;

int n, m;
int x, y;
int rmq[NMAX+1][20];
int calc_log[NMAX+1];

void build_rmq()
{
    calc_log[1] = 0;
    for(int i=2; i<=NMAX; i++)
    {
        calc_log[i] = calc_log[i/2] + 1;
    }
    for(int lg=1; (1<<lg)<=n+1; lg++)
    {
        for(int i=1; i<=n; i++)
            if(i+(1<<(lg-1)) <= n)
            {
                rmq[i][lg] = min(rmq[i][lg-1],rmq[i+(1<<(lg-1))][lg-1]);
            }
    }
}

int query(int st, int dr)
{
    int sz = dr-st+1;
    int lg = calc_log[sz];
    return min(rmq[st][lg], rmq[dr-(1<<lg)+1][lg]);
}

int main()
{
    fin >> n >> m;
    for(int i=1; i<=n; i++)
        fin >> rmq[i][0];
    build_rmq();
    for(int i=1; i<=m; i++)
    {
        fin >> x >> y;
        fout << query(x, y) << '\n';
    }
    return 0;
}