// Range Minimum Query
#include <iostream>
#include <algorithm>
#include <fstream>
using namespace std;

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

const int NMAX = 100005;
const int LMAX = 18;
int n, m;
int a[NMAX];
int rmq[LMAX][NMAX]; 
int log1[NMAX];

int query1(int L, int R)
{
    int lenght = R - L + 1;
   /* while ((1 << (k + 1)) <= lenght)
    {
        k++;
    }*/
    int k = log1[lenght];
    return min(rmq[k][L], rmq[k][R - (1 << k) + 1]);
}

int main()
{
    fin >> n >> m;
    log1[1] = 0;
    for (int i = 2; i <= n; i++)
    {
        log1[i] = log1[i / 2] + 1;
    }
    for (int i = 1; i <= n; i++)
    {
        fin >> a[i];
        rmq[0][i] = a[i];
    }
    for (int i = 1; (1 << i) <= n; i++)
    {
        for (int k = 1; k <= n - (1 << i) + 1; k++)
        {
            rmq[i][k] = min(rmq[i - 1][k], rmq[i - 1][k + (1 << (i - 1))]);
        }
    }
    for (int i = 1; i <= m; i++)
    {
        int L, R;
        fin >> L >> R;
        fout << query1(L, R) << '\n';
    }
    return 0;
}