#include <iostream>
#include <fstream>
 
using namespace std;
 
ifstream fin ("rmq.in");
ofstream fout ("rmq.out");
 
const int SIZE = 100001;
const int LOG = 17;
 
int st[SIZE][LOG + 1];
int logarithm[SIZE];
 
int main()
{
    int n, q;
    fin >> n >> q;
 
    for (int i = 1; i <= n; i++)
    {
        fin >> st[i][0];
    }
 
    for (int j = 1; j <= LOG; j++)
    {
        for (int i = 1; i-1 + (1 << j) <= n; i++)
        {
            st[i][j] = min(st[i][j-1], st[i + (1 << (j-1))][j-1]);
        }
    }
 
    logarithm[1] = 0;
    for (int i = 2; i <= SIZE; i++)
    {
        logarithm[i] = logarithm[i/2] + 1;
    }
 
    for (int i = 1; i <= q; i++)
    {
        int left, right;
        fin >> left >> right;
 
        int length = right - left + 1;
        int j = logarithm[length];
        fout << min(st[left][j], st[right+1 - (1 << j)][j]) << "\n";
    }
    return 0;
}