#include <bits/stdc++.h>

using namespace std;

const int INF = 1e6;

int n, m, L;
vector <int> lg;
vector <vector <int> > rmq;

void process2pow()
{
    lg.resize(n + 1);
    for(int i = 2; i <= n; i ++)
        lg[i] = lg[i / 2] + 1;
}

void sparseTabel()
{
    rmq.resize(L + 1, vector <int> (n + 1, INF));
    for(int i = 1; i <= n; i ++)
        cin >> rmq[0][i];

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

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

int main()
{
    ios_base :: sync_with_stdio(0);
    cin.tie(0);

    freopen("rmq.in", "r", stdin);
    freopen("rmq.out", "w", stdout);

    cin >> n >> m;

    process2pow();
    L = lg[n];

    sparseTabel();

    for(int i = 1; i <= m; i ++)
    {
        int x, y;
        cin >> x >> y;
        cout << query(x, y) << "\n";
    }
    return 0;
}