#include <iostream>
#include <vector>

using namespace std;

vector <longint> a, b;
int count = 0;

void mergeSort(int l, int r){
    if (l >= r) {
        return;
    }
    int m = (l + r + 1)/2;
    mergeSort(l, m - 1);
    mergeSort(m, r);


    int i = l;
    int j = m;
    int k = l;
    while (k <= r){

        if (i < m && (j > r || a[i] <= a[j])){
            b[k] = a[i];
            ++i;
            ++k;
        } else {
            b[k] = a[j];
            ++j;
            ++k;
            count += m - i;
        }
    }

    for (int x = l; x <= r; ++x) {
        a[x] = b[x];
    }
return;

}

int main() {
    int n;
    int L;
    cin >> n >> L;
    a.resize(n);
    b.resize(n);
    double w;
    for (int i = 0; i < n; ++i){
        cin >> w;
        a[i] = L*w + i;
    }
    mergeSort(0, a.size() - 1);
    cout << count << "\n";
}