#include <bits/stdc++.h>
using namespace std;
ifstream fin("rmq.in");
ofstream fout("rmq.out");
const int NMAX = 1e5 + 5, LOG = 17;
int n, q, a[NMAX], rmq[LOG][NMAX];

void build()
{
    for(int i = 1; i <= n; i++)
        rmq[0][i] = a[i];

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

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

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

    return 0;
}