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.
for i in range(n):
    dummylist=[]
    dummy=0
    dummylist.append(numlist[i])
    for j in range(n):
        dummy1=numlist[j]
        check=0
        for l in range(len(dummylist)):
            if numlist[j] / dummylist[l] != k and dummylist[l] / numlist[j] != k and i != j:
                check=0
            else:
                check=1
                break
        if check==0:
            dummylist.append(dummy1)

    if len(dummylist)>max:
        max=len(dummylist)
    # print(*dummylist)
print(max)