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.
import sys
k = int(sys.stdin.readline().split()[1])
t = list(map(lambda s: int(s), sys.stdin.readline().split()))
t.sort()
# print(t)
def find(x, a, b):
    if a == b:
        if x == t[a]:
            return a
        else:
            return None
    m = a + (b - a) // 2
    if x > t[m]:
        a = m + 1
    else:
        b = m
    return find(x, a, b)
u = [True for i in t]
s = 0
for i in range(len(t)):
    if u[i]:
        s += 1
        u[i] = False
        j = find(t[i] * k, 0, len(t) - 1)
        # print(t[i] * k, j)
        if j is not None:
            u[j] = False
print(s)