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

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

int n, m;
int a[100001],lg[100001];
int rmq[17][100001];

int main()
{
    int x, y,k;
    fin >> n >> m;
    for (int i = 1; i <= n; i++)
        fin >> a[i];
    lg[1] = 0;
    for (int i = 2; i <= n; i++)
        lg[i] = lg[i / 2] + 1;
    for (int i = 1; i <= n; i++)
        rmq[0][i] = a[i];
    for (int i = 1; (1 << i) <= n; i++)
        for (int j = (1 << i); j <= n; j++)
            rmq[i][j] = min(rmq[i - 1][j], rmq[i - 1][j - (1 << (i - 1))]);
    while (m--)
    {
        fin >> x >> y;
        k = lg[y - x + 1];
        fout << min(rmq[k][x + (1 << k) - 1], rmq[k][y]) << "\n";
    }
    fin.close();
    fout.close();
    return 0;
}