#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 100010;
int q[N];
int main()
{
int n,p;
cin>>n>>p;
for (int i = 0; i < n; i ++ ){
cin>>q[i];
}
sort(q,q+n);
int cnt=0;
for(int i = 0,j=0;i<n;i++){
while((long long)q[j]*p<q[i])
j++;
cnt = max(cnt,i-j+1);
}
cout<<cnt;
return 0;
}