#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < n; i++)
#define srep(i,a,b) for(int i = a; i < b; i++)
#define all(A) (A).begin(),A.end()
#define MOD 1000000007
using namespace std;
using ll = long long;
using P = pair<int,string>;
using Graph = vector<vector<int>>;

int main(void){
	ll n,k; cin >> n >> k;
	vector<ll> A(n); rep(i,n) cin >> A[i];
	sort(A.begin(),A.end());
	
	ll cnt = 0;
	rep(i,n){
		ll ok = n,ng = -1;
		while(abs(ok-ng) > 1){
			ll mid = (ok+ng)/2;
			if(A[i]*A[mid] >= 2*k) ok = mid;
			else ng = mid;
		}
		cnt += n-ok;
	}
	cout << cnt;
}