#include #include #include #include #include #include #include #include #include #include using ll = long long; using namespace std; int main() { ll n, k, sum1 = 0; cin >> n >> k; vector a(n); for (int i = 0; i < n; i++) cin >> a[i]; sort(a.begin(), a.end()); for (ll i = 0; i < n; i++){ for (ll j = 0; j < n; j++){ if (a[i]*a[j] >= 2*k){ sum1 += (n-j); break; } } } cout << sum1 << endl; }