#include <bits/stdc++.h>
#define N 100000

using namespace std;

int n, m, v[N + 1], r[N + 1][17];
unsigned short lg[N + 1];

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

int minim(int a, int b)
{
    if(a > b)
        return b;
    return a;
}

void Construiesc_matrice()
{
    for(int i = 1; i <= n; i++)
    {
        r[i][0] = v[i];
        for(int j = 1; (1 << j) <= i; j++)
        {
            int k = i - (1 << (j-1));
            r[i][j] = minim(r[i][j-1], r[k][j-1]);
        }
    }
}

void Construiesc_log()
{
    lg[1] = 0;
    for(int i = 2; i <= n; i++)
        lg[i] = lg[i/2] + 1;
}


void Citire()
{
    int a, b;
    fin >> n >> m;
    for(int i = 1; i <= n; i++)
    {
        fin >> v[i];
// r[1][i] = v[i];
    }
    Construiesc_matrice();
    Construiesc_log();

    for(int i = 1; i <= m; i++)
    {
        fin >> a >> b;
        int l = lg[b-a+1];
        fout << minim(r[b][l], r[a + (1<<l)-1][l]) << '\n';
    }

}

int main()
{
    Citire();
    return 0;
}