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())
a = [*map(int, input().split())]

a.sort()

def binary_search(arr, value):
    first, last = 0, len(arr)-1
    while first <= last:
        mid = (first + last) // 2
        if arr[mid] == value:
            return True
        elif arr[mid] < value:
            first = mid + 1
        else:
            last = mid - 1
    return False

ans = 0
for i in range(n):
    ans += not binary_search(a, a[i]*k)

print(ans)