#include <bits/stdc++.h>

using namespace std;

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

int n,q;
int a[100001],lg[100001],rmq[17][100001];

void build_rmq()
{
    for (int i = 2; i <= n; i++)
        lg[i] = 1 + lg[i / 2];
    for (int i = 1; i <= n; i++)
        rmq[0][i] = a[i];
    for (int j = 1; j <= lg[n]; j++)
        for (int i = 1; i <= n - (1 << j) + 1; i++)
            rmq[j][i] = min(rmq[j - 1][i],rmq[j - 1][i + (1 << (j - 1))]);
}

int query(int l,int r)
{
    int lgg = lg[r - l + 1];
    return min(rmq[lgg][l],rmq[lgg][r - (1 << lgg) + 1]);
}

int main()
{
    in >> n >> q;
    for (int i = 1; i <= n; i++)
        in >> a[i];
    build_rmq();
    int l,r;
    for (int i = 1; i <= q; i++)
    {
        in >> l >> r;
        out << query(l,r) << '\n';
    }
    return 0;
}