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(a,x,n):
	low = 0
	high = n-1
	flag = False
	while(low <= high and flag == False):
		mid = (low+high)//2
		if(a[mid] == x):
			flag = True
		else:
			if(x < a[mid]):
				high = mid - 1
			else:
				low = mid + 1
	return flag

n,k = map(int,input().split())

a = list(map(int,input().split()))

s = []
m = 0
a = sorted(a)

for i in a:
	if(i % k != 0):
		s.append(i)
		m += 1
	elif(bSearch(s,i/k,m) == False):
		s.append(i)
		m += 1

print(m)
#print(s)