#include <bits/stdc++.h>

#define maxn 100005

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

int v[maxn], rmq[maxn][20];

int main()
{
    int n, m;
    fin >> n >> m;
    for(int i = 1; i <= n; i++)
    {
        fin >> v[i];
        rmq[i][0] = v[i];
    }
    for(int j = 1; j <= log2(n); ++j){
        for(int i = 1; i + (int)std::pow(2, j-1) <= n; ++i)
        {
            rmq[i][j] = std::min(rmq[i][j-1], rmq[i + (int)std::pow(2, j-1)][j-1]);
        }
    }
    int x, y, k;
    for(int i = 1; i <= m; ++i)
    {
        fin >> x >> y;
        k = (int)log2(y-x+1);
        fout << std::min(rmq[x][k], rmq[y+1-(int)std::pow(2,k)][k]) << '\n';
    }
}