#include <bits/stdc++.h>
using namespace std;
ifstream fin ("rmq.in");
ofstream fout ("rmq.out");
const short Pmax = 17;
int n , m;
int rmq[Pmax][1 << Pmax] , put2[Pmax];
int main()
{
    int k , x , y  , L;
    fin >> n >> m;
    for(int i = 1 ; i <= n ; i++)
    {
        fin >> x;
        rmq[0][i] = x;
    }
    put2[1] = 0;
    for(int i = 2 ; i <= n ; i++)
        put2[i] = put2[i >> 1] + 1;
    k = put2[n];
    for(int i = 1 ; i <= k ; i++)
        for(int j = 1 ; j <= n - (1 << i) + 1 ; j++)
            rmq[i][j] = min(rmq[i - 1][j] , rmq[i - 1][j + (1 << (i - 1))]);
    while(m--)
    {
        fin >> x >> y;
        L = y - x + 1;
        k = put2[L];
        fout << min(rmq[k][x] , rmq[k][y - (1 << k) + 1]) << "\n";
    }
    fin.close();
    fout.close();
    return 0;
}