#include <bits/stdc++.h>

using namespace std;

const int NMAX = 100005, LOGMAX = 17;
long long rmq[NMAX][LOGMAX];
long long n;
vector<long long> a;

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

    for(int p = 1; (1 << p) <= n; p ++)
        for(int i = 1; i <= n; i ++)
        {

            rmq[i][p] = rmq[i][p - 1];
            if(i + (1 << p) - 1 <= n)
                rmq[i][p] = min(rmq[i][p], rmq[i + (1 << (p - 1))][p - 1]);
        }
}

int main()
{
    int q;
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    freopen("rmq.in", "r", stdin);
    freopen("rmq.out", "w", stdout);
    cin >> n;
    cin >> q;
    a = vector<long long>(n + 1);
    for(int i = 1; i <= n; i ++)
        cin >> a[i];
    precalc();

    //E[i] -> cea mai mare putere a lui 2 mai mica decat i
    int E[100001];
    E[1] = 0;
    for(int i = 2; i <= n; i ++)
        E[i] = E[i / 2] + 1;
    for(int i = 1; i <= q; i ++)
    {
        int st, dr;
        cin >> st >> dr;
        int len = (dr - st + 1);
        int lg = E[len];
        cout << min(rmq[st][lg], rmq[dr - (1 << lg) + 1][lg]) << '\n';
    }
    return 0;
}