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.
n = input()
n = n.split(' ')
(a,b)  = (int(n[0]),int(n[1]))

A = []    # 
S = []    # salidas

k=b   #Multiplicador K

o = input()
o = o.split(' ')

for i in range(a):   #Cantidad de números
  A.append(int(o[i]))

A = sorted(A)
for i in range(a-1):
  x = A[i]
  for j in range(a-1-i):
    y = A[i+j+1]
    if x*k == y:    #Encontramos un y=x*k
      S.append(x)
    if x > A[i+j+1]:
      break

l = len(S)
print(l)
		 	 			  	 	 	 		    	 	 			