#include <bits/stdc++.h>
using namespace std;
const int NMAX = 100000;
const int K = 25;

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

long long n, q;
vector<long long> A(NMAX + 4);

struct SparseTable
{
    long long st[K + 1][NMAX + 4];

    long long log2_floor(long long x)
    {
        long long rez = (log(x) / log(2));
        if (x == (1 << rez))
        {
            rez--;
        }
        return rez;
    }

    void precomputation()
    {
        copy(A.begin(), A.end(), st[0]);
        for (int i = 1; i <= K; i++)
        {
            for (int j = 1; (j + (1 << i) - 1) <= n; j++)
            {
                st[i][j] = min(st[i - 1][j], st[i - 1][j + (1 << (i - 1))]);
            }
        }
    }

    long long minimum(long long left, long long right)
    {
        long long i = log2_floor(right - left + 1);
        long long mini = min(st[i][left], st[i][right - (1 << i) + 1]);
        return mini;
    }
} ST;

int main()
{
    fin >> n >> q;
    for (int i = 1; i <= n; i++)
    {
        fin >> A[i];
    }
    ST.precomputation();
    for (int i = 1; i <= q; i++)
    {
        long long left, right;
        fin >> left >> right;
        fout << ST.minimum(left, right) << '\n';
    }
    return 0;
}