#include <bits/stdc++.h>
using namespace std;

ifstream fin("rmq.in");
ofstream fout("rmq.out");

int n, m;
int a[100005];
int rmq[20][100005], e[100005];

void MakeRMQ()
{
    int i, j, L;
    e[1] = 0;
    for (i = 2; i <= n; i++)
        e[i] = e[i / 2] + 1;

    for (i = 1; i <= n; i++)
        rmq[0][i] = a[i];

    for (i = 1; i <= e[n]; i++)
    {
        L = (1 << i);
        for (j = 1; j <= n - L + 1; j++)
            rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j + L / 2]);
    }
}

int main()
{
    int x, y, expo;
    fin >> n >> m;
    for (int i = 1; i <= n; i++)
        fin >> a[i];
    MakeRMQ();
    while (m--)
    {
        fin >> x >> y;
        expo = e[y - x + 1];
        fout << min(rmq[expo][x], rmq[expo][y - (1 << (expo)) + 1]) << "\n";
    }
    return 0;
}