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,k=map(int,input().split())
l=list(map(int,input().split()))
l.sort()
d={}
c=1
p=[0]*n
d[l[0]]=0
p[0]=1
for i in range(1,n):
	a=c
	d[l[i]]=c
	if l[i]%k==0 and (l[i]//k in d):
		a=d[l[i]//k]
		d[l[i]]=a
		c-=1
	p[a]+=1
	c+=1
s=0
print(p)
for i in range(n):
	if p[i]==0:
		break
	s+=(p[i]//2)
	if p[i]%2!=0:
		s+=1
print(s)