#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
int main()
{
int N, p;
cin >> N >> p;
vector<int>Q;
for (int i = 0; i < N; i++)
{
int a;
cin >> a;
Q.push_back(a);
}
sort(Q.begin(), Q.end(), less<int>());
int count = 0;
for (int i = 0; i < Q.size(); i++)
{
for (int j = i+count ; j < Q.size(); j++)
{
if (Q[i] * p < Q[j])
break;
if((j-i+1)>count)
count = j - i + 1;
}
}
cout << count;
system("pause");
return 0;
}
流下了不学无数的泪水orz