A *k*-multiple free set is a set of integers where there is no pair of integers where one is equal to another integer multiplied by *k*. That is, there are no two integers *x* and *y* (*x* &lt; *y*) from the set, such that *y* = *x*·*k*.

You're given a set of *n* distinct positive integers. Your task is to find the size of it's largest *k*-multiple free subset.
The first line of the input contains two integers *n* and *k* (1 ≤ *n* ≤ 10<sup class="upper-index">5</sup>, 1 ≤ *k* ≤ 10<sup class="upper-index">9</sup>). The next line contains a list of *n* distinct positive integers *a*<sub class="lower-index">1</sub>, *a*<sub class="lower-index">2</sub>, ..., *a*<sub class="lower-index">*n*</sub> (1 ≤ *a*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">9</sup>).

All the numbers in the lines are separated by single spaces.
n,k = map(int,input().split())
lis = [0]+sorted(map(int,input().split()))
kk=lis[:]
ans=0
#print(lis)
for i in range(n,-1,-1):
    l=0
    r=i
    if kk[i]==0:
        continue
    while l<=r:
        mid = l + (r-l)//2
        if lis[i]/k <lis[mid]:
            r=mid-1
        else:
            l=mid+1         
    if lis[r]*10 ==lis[i]/k *10:
        kk[r]=0
    ans+=1
#    print(r,ans,lis[i],lis[r],lis[i]/k,lis)    
print(ans)        


