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.
from sys import stdin ,stdout 
input=stdin.readline
def print(*args, end='\n', sep=' ') -> None:
    stdout.write(sep.join(map(str, args)) + end)

def check(val,ind):
    r=n-1 ; l=ind
    while l<=r:
        mid=(l+r)//2
        if arr[mid]==val*2:
            return False
        elif arr[mid]>2*val:
            r=mid-1
        else:
            l=mid+1
    return True

n,k=map(int,input().split()) ; arr=list(map(int,input().split())) ; arr.sort() ; ans=0
for i in range(n):
    if check(arr[i],i):ans+=1
print(ans)
