#include <bits/stdc++.h>

using namespace std;

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

const int N = 1e5 + 10;
const int L = 20;

int rmq[L][N];
char iLog2[N];
int n, m;

void precompute()
{
    // precompute log2
    iLog2[1] = 0;
    for(int i = 2; i < N; i++)
        iLog2[i] = iLog2[i/2] + 1;

    // precompute rmq
    for(int p = 1; (1 << p) < n; p++)
    {
        for (int i = 0; i + (1 << p) < n; i++)
        {
            rmq[p][i] = min(rmq[p-1][i], rmq[p-1][i + (1 << (p - 1))]);
        }
    }
}


int solveQuery(int l, int r)
{
    int p = iLog2[r - l + 1];
    return min(rmq[p][l], rmq[p][r - (1 << p) + 1]);
}

int main()
{
    fin >> n >> m;
    for(int i = 0; i < n; i++)
        fin >> rmq[0][i];

    precompute();

    while(m--)
    {
        int l, r;
        fin >> l >> r;
        l--; r--;
        fout << solveQuery(l, r) << '\n';
    }
    return 0;
}