#include <bits/stdc++.h>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");

const int NMAX = 1e5 + 5, LOG = 18;
int n, m, a[NMAX], rmq[NMAX][LOG];

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

int query(int st, int dr)
{
    int log2 = 31 - __builtin_clz(dr - st + 1);
    return min(rmq[st][log2], rmq[dr-(1<<log2)+1][log2]);
}

int main()
{
    fin >> n >> m;
    for(int i = 1; i <= n; i++)
        fin >> a[i];
    build_rmq();
    while(m--)
    {
        int st, dr;
        fin >> st >> dr;
        fout << query(st, dr) << "\n";
    }

    fin.close();
    fout.close();
    return 0;
}