#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using ll=long long;
using Graph=vector<vector<pair<int,ll>>>;
#define INF 1000000000000000000
#define MOD 1000000007
#define MAX 1000

int main(){
  int N;
  ll K;
  cin>>N>>K;
  vector<ll> A(N);
  for(int i=0;i<N;i++){
    cin>>A[i];
  }
  sort(A.begin(),A.end());

  ll ans=0;
  for(int i=0;i<N;i++){
    int k=upper_bound(A.begin(),A.end(),(2*K-1)/A[i])-A.begin();
    ans+=(ll)N-k;
  }
  cout<<ans<<'\n';
}