#include <bits/stdc++.h>
using namespace std;

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


int n, m, dp[20][1000001], lg[1000001], st, dr;
vector<int> v(1000001);

int main ()
{
    fin >> n >> m;

    for(int i = 1; i <= n; i++)
        fin >> v[i];

    for(int i = 1; i <= n; i++)
        dp[0][i] = v[i];

    for (int i = 2; i <= n; i++)
        lg[i] = lg[i / 2] + 1;

    for(int i = 1; (1 << i) <= n; i++)
        for(int j = 1; j <= n - (1 << i) + 1; j++)
        {
            dp[i][j] = min(dp[i-1][j], dp[i-1][j + (1 << (i - 1))]);
        }

    for(int i = 1; i <= m; i++)
    {
        fin >> st >> dr;

        int j = lg[dr - st + 1];
        int x = dp[j][st];
        int y = dp[j][dr - (1 << j) + 1];
        int ans = min(x, y);

        fout << ans << '\n';
    }

    return 0;
}