#include <bits/stdc++.h>


using namespace std;

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

int v[100100], n, m;
int w[100100][20];
int logaritm[100100];

void precalc()
{
    logaritm[2] = 1;
    for(int i = 3; i <= 100000; i ++)
    {
        logaritm[i] = logaritm[i / 2] + 1;
    }
    for(int i = 1; i <= n; i ++)
    {
        w[i][0] = v[i];
    }
    for(int j = 1; (1 << j) <= n; j ++)
    {
        for(int i = 1; i + (1 << j) - 1 <= n; i ++)
        {
            w[i][j] = min(w[i][j-1], w[i + (1 << (j-1))][j-1]);
        }
    }
}

int ans(int l, int r)
{
    int lungime = r - l + 1;
    int logg = logaritm[lungime];
    return min(w[l][logg], w[r - (1<<logg)+1][logg]);
}

int main()
{
    fin >> n >> m;
    for(int i = 1; i <= n; i ++)
    {
        fin >> v[i];
    }
    precalc();
    while(m--)
    {
        int l, r;
        fin >> l >> r;
        fout << ans(l,r) << '\n';
    }
}