#include<iostream>
#include<string>
#include<queue>
#include<vector>
#include<cassert>
#include<random>
#include<set>
#include<map>
#include<cassert>
#include<unordered_map>
#include<bitset>
#include<numeric>
#include<algorithm>
using namespace std;
typedef long long ll;
const int inf=1<<30;
const ll INF=1LL<<62;
typedef pair<int,ll> P;
typedef pair<int,P> PP; 
const ll MOD=998244353;

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++){
        auto it=lower_bound(A.begin(),A.end(),(2*K+(A[i]-1))/A[i]);
        int c=A.end()-it;
        ans+=c;
    }

    cout<<ans<<endl;

}