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.
s = input().split()
n, k = int(s[0]), int(s[1])
s = input().split()
a = []
for x in s:
    a.append(int(x))
a.sort()
ans = n
for i in range(n):
    if a[i] == -1:
        continue
    l, r = i + 1, n - 1
    j = -1
    while l < r and j == -1:
        m = (l + r) // 2
        if a[m] < a[i] * k:
            l = m + 1
        elif a[m] > a[i] * k:
            r = m
        else:
            j = m
    m = (l + r) // 2
    if a[m] == a[i] * k:
        j = m
    if j != -1:
        a[j] = -1
        ans -= 1
print(ans)