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 search(v,l):
	n=len(l)
	low=0
	hi=n-1
	while(low<=hi):
		mid=int((low+hi)/2)
		if(l[mid]>v):
			hi=mid-1
		elif l[mid]<v:
			low=mid+1
		else:
			return mid
	return False


n,k = map(int,input().strip().split())
v = list(map(int,input().strip().split()))
c=n
v.sort()
low=0
for i in v:
	pos = search(i*k,v[low:])
	if pos:
		pos+=low
		c-=1
		low=pos
print(c)

  	  				    	   	 		 	 		  		