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

const int N = 100001;
const int L = 18;

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

int n, k, m[N][L], logs[N + 1], x, y;

int qr(int l, int r)
{
    int len = r - l + 1;
    int lg = __lg(len);
    return min(m[l][lg],m[r-(1<<lg) + 1][lg]);
}

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