#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>

#define rep(i,n) for(i=0; i<n; ++i)
#define in(a) cin >> a
#define out(a,b) cout << a << b
using namespace std;
using lint = long long;

int main(void){
    int i, j;
    int n, m;
    lint k;
    in(n);
    in(k);
    vector<int> a(n);
    rep(i,n)    in(a[i]);
    sort(a.begin(), a.end());
    int cnt=0, ans=0;
    j=n-1;
    rep(i,n){
        lint min=2*k/a[i];
        if(2*k%a[i]) min++;
        for(; j>=i-1; --j){
            if(a[j]<min) break;
        }
        if(j<0) break;
        if(i-1>=j) break;
        cnt=n-1-j;
        ans+=2*cnt;
    }
    for(; i<n; ++i){
        cnt=n-i;
        ans+=2*cnt-1;
    }
    out(ans,endl);
    return 0;
}