#include <bits/stdc++.h>
using namespace std;
 
int rmq[100005][25];
int logs[100005], vc[100005];
 
void build(int v[], int n)
{
    for (int i = 0; i < n; i++)
        rmq[i][0] = v[i];
 
    int k = logs[n];
    for (int j = 1; j <= k; j ++) 
    {
        for (int i = 0; (i + (1 << j)) <= n; i ++) 
        {
            rmq[i][j] = min(rmq[i][j - 1], rmq[i + (1 << (j - 1))][j - 1]);
        }
    }
}
 
int query(int i, int j)
{
    int l = j - i + 1;
    int k = logs[j - i + 1];
    return min(rmq[i][k], rmq[i + l - (1 << k)][k]);
}
 
int main()
{
    ifstream fin("rmq.in");
    ofstream fout("rmq.out");
    int n, q; fin >> n >> q;
    for (int i = 0; i < n; i ++)
        fin >> vc[i];
    for(int i = 2; i <= 100005; i ++)
        logs[i] = 1 + logs[i / 2];
    build (vc, n);
    for (int i = 0; i < q; i ++)
    {
        int a, b; fin >> a >> b;
        fout << query(a - 1, b - 1) << '\n';
    }
    return 0;
}