#include <bits/stdc++.h>

using namespace std;

int matr[100001][17], listaNumere[10000];
int n, m;

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

void Preporcess()
{
    for(int i = 0; i <=n; i++)
        matr[0][i] = listaNumere[i];

    for(int i = 1; i <= (int)log2(n); i++)
        for(int j = 0; j <= n - ((1<<i) - 1); j++)
            matr[i][j] = min(matr[i-1][j], matr[i - 1][j + (1<<(i-1))]);
}

int main()
{
    f>>n>>m;
    for(int i = 0; i < n ; i++)
    {
        f>>listaNumere[i];
    }

    Preporcess();
    for(int i = 0; i < m ; i++)
    {
        int st, dr;
        f>>st>>dr;
        if(st != 0)
            st--;
        dr--;
        int lungQuery = dr - st + 1;
        int l2 = (int)log2(lungQuery);
        g<<min(matr[l2][st], matr[l2][dr - (1<<(l2)) + 1])<<'\n';
    }
    return 0;
}