#include <bits/stdc++.h>

using namespace std;

ifstream f("rmq.in");
ofstream o("rmq.out");

int n, m, x, l, r, a[100001], rmq[100001][17];

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

    for (int j = 1; (1<<j) <= n; j++)
        for (int i = 0; i + (1<<j) - 1 <= n; i++)
                if (a[rmq[i][j-1]] < a[rmq[i + (1<<(j-1))][j-1]])
                    rmq[i][j] = rmq[i][j-1];
                else
                    rmq[i][j] = rmq[i + (1<<(j-1))][j-1];
}

int gasireMinim(int l, int r, int a[])
{
    int j = (int)log2(r-l+1);

    if (a[rmq[l][j]] < a[rmq[r - (1 << j) + 1][j]])
        return a[rmq[l][j]];
    return a[rmq[r - (1 << j) + 1][j]];
}

int main()
{
    f>>n>>m;
    for (int i = 1; i <= n; i++)
        {
            f>>x;
            a[i] = x;
        }
    creareMatrice(n,a);

    for (int i = 0; i < m; i++)
    {
        f>>l>>r;
        o<<gasireMinim(l,r,a)<<'\n';
    }
}