#include <bits/stdc++.h>

using namespace std;

const int maxn = 1e6;

int n, m, a[maxn+1];
long long ans = 0;
vector<int> v;

void sub1()
{
    for (int i = 1; i <= n; i++)
    {
        bool check = 0;
        for (int j = i; j <= n; j++)
        {
            if (a[j] >= m) check = 1;
            if (check)
            {
                ans++;
                continue;
            }
        }
    }
    cout << ans;
}

void sub3()
{
    int l = 1, r;
    for (r = 1; r <= n; r++)
    {
        if (a[r] >= m) v.push_back(r);
        int vsize = v.size();
        while (vsize > 0)
        {
            ans += n - r + 1;
            if (a[l] >= m) v.erase(v.begin(), v.begin() + 1);
            l++;
            vsize = v.size();
        }
    }
    cout << ans;
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    freopen("COUNT.INP", "r", stdin);
    freopen("COUNT.OUT", "w", stdout);
    cin >> n >> m;
    for (int i = 1; i <= n; i++) cin >> a[i];
    if (n <= 1e3) sub1();
    else sub3();
}