#define HAVE_STRUCT_TIMESPEC

 #include<bits/stdc++.h>

 using namespace std;

 typedef struct node{

     long long val;

     bool flag;

 };

 bool cmp(node a,node b){

     if(a.val!=b.val)

         return a.val<b.val;

     return a.flag>b.flag;

 }

 node a[];

 map<int,int>pos;

 int main(){

     ios::sync_with_stdio(false);

     cin.tie(NULL);

     cout.tie(NULL);

     int n,p;

     cin>>n>>p;

     for(int i=;i<=n;++i)

         cin>>a[i].val;

     for(int i=;i<=n;++i){

         a[i+n].val=a[i].val*p+;

         a[i+n].flag=;

     }

     sort(a+,a++n+n,cmp);

     int cnt=;

     int ans=;

     for(int i=;i<=n+n;++i){

         if(a[i].flag==){

             ++cnt;

             if(!pos[a[i].val])

                 pos[a[i].val]=cnt;

         }

         else{

             int x=(a[i].val-)/p;

             int tamp=cnt-pos[x]+;

             ans=max(ans,tamp);

         }

     }

     cout<<ans;

     return ;

 }