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.
numero=[int(x)for x in input("").strip().split(" ")]
lista=[int(x)for x in input("").strip().split(" ")]
contador=0
lista2=lista
lista3=list()
for y in range(len(lista)):
    for q in range(len(lista)):
        if lista[y]==lista[q] and y!=q:
            lista2.append(34534667)
            del lista2[q]
for c in range(len(lista2)):
    if lista2[c]!=34534667:
        lista3.append(lista2[c])
            
for i in range(len(lista3)):
    for x in range(len(lista3)):
        if lista3[i]*numero[1]==lista3[x]:
            contador=contador+1
print(contador)
