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.
# link: https://codeforces.com/contest/275/problem/C

for _ in range(1):
    n, k = map(int, input().split())
    numbers = list(map(int, input().split()))
    visited = set()
    numbers.sort()
    for i in range(n):
        if numbers[i] % k != 0:
            visited.add(numbers[i])
        else:
            if numbers[i] // k in visited:
                # skip
                continue
            else:
                visited.add(numbers[i])
    print(len(visited))                