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

const int N = 1e5 + 5;
int rmq[17][N], n, m, a, b, e[N];

inline int query()
{
    int l = b - a + 1;
    int p = e[l];
    return min(rmq[p][a], rmq[p][b - (1 << p) + 1]);
}

int main()
{
    fcin >> n >> m;
    for (int i = 1; i <= n; i++)
        fcin >> rmq[0][i];
    for (int i = 2; i <= n; i++)
        e[i] = e[i / 2] + 1;
    for (int i = 1; (1 << i) <= n; 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))]);
        }
    while (m--)
    {
        fcin >> a >> b;
        fcout << query() << '\n';
    }
    return 0;
}