#include <fstream>
#include <cmath>

using namespace std;

ifstream cin("rmq.in");
ofstream cout("rmq.out");

int n, m, a[100005], dp[100005][100];

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

    for(int i = 1; i <= n; i++)
    {
        cin >> a[i];
        dp[i][0] = a[i];
    }

    for(int j = 1; pow(2, j) <= n; j++)
    {
        int lg = int(pow(2, j));

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


    for(int i = 1; i <= m; i++)
    {
        int x, y;

        cin >> x >> y;

        int p = 1, e = 0;

        while(p * 2 <= y - x + 1)
        {
            p *= 2;
            e++;
        }

        cout << min(dp[x][e], dp[y - p + 1][e]) << '\n';
    }

    return 0;
}