#include <bits/stdc++.h>

using namespace std;

const int N = 2e5 + 5;

int v[N];

int n, q;


int rmq[N][18];

int answer(int l, int r)
{
    int lung = r - l + 1;
    int j = 0;
    while((1 << (j + 1)) <= lung)
    {
        j++;
    }
    return min(rmq[l][j], rmq[r - (1 << j) + 1][j]);
}

int main()
{
    cin >> n >> q;
    for(int i = 1; i <= n; i++)
        cin >> v[i];
    for(int i = 1; i <= n; i++)
    {
        rmq[i][0] = v[i];
    }
    for(int j = 1; j < 18; j++)
    {
        for(int i = 0; i + (1 << j) - 1 <= n; i++)
        {
            rmq[i][j] = min(rmq[i][j - 1], rmq[i + (1 <<(j - 1))][j - 1]);
        }
    }
    while(q--)
    {
        int l, r;
        cin >> l >> r;
        cout << answer(l, r) << '\n';
    }
    return 0;
}