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.
num,k=[int(x) for x in input().split()]
arr=[int(x) for x in input().split()]
different=set()
temp=0
arr.sort()
for x in  arr:
    if x%k==0 and x//k in different:
        different.remove(x//k)
    different.add(x)
    print(different)
    temp=max(len(different),temp)
different=set()
for x in arr:
    if (x%k!=0 or not  x//k in different):
        different.add(x)
    print(different)
    temp=max(len(different),temp)
print(temp)


    # if x%k!=0:
    #     different.add(x)
    # elif x//k in different:
    #     different.remove(x//k)
    #     different.add(x)
    # else:
    #     different.add(x)
