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.
def bSearch(x,li):
	l=0
	h=len(li)
	while(l<=h):
		m=(l+h)//2
		if(li[m]==x):
			return m
		elif(li[m]>x):
			h=m-1
		else:
			l=m+1
	return -1
n,k=map(int,input().split())
li=list(map(int,input().split()))
li.sort()
s=set()
for i in range(n):
	if(li[i]%k==0):
		z = bSearch(li[i]//k,li)
		if(z!=-1):
			if li[z] not in s:
				s.add(li[i])
		else:
			s.add(li[i])
	else:
		s.add(li[i])
print(len(s))
		
