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


def main():
    n, k = map(int, stdin.readline().split())
    ar = list(map(int, stdin.readline().split()))
    ar.sort()
    lk = set()
    check = {}
    for elm in ar:
        lk.add(elm)
        check[elm] = False
    ans = 0
    max_val = ar[-1]
    for i in range(n):
        if not check[ar[i]]:
            cnt = 0
            curr = ar[i]
            while curr <= max_val and curr in lk:
                cnt += 1
                check[curr] = True
                curr = curr * k
            ans += (cnt // 2) + (cnt % 2)
    print(ans)


if __name__ == "__main__":
    main()