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 bs (l=0,r=0,val=0):
    l1 =l
    r1 =r
    while (l1 <= r1):
         mid = (l1 + r1) // 2;

         if a[mid]  < val :
              l1= mid+1
         elif a[mid] > val:
              r1 = mid-1
         elif a [mid] == val :
             return mid  ;
    return -1

mark= {}
n,k= map (int,input().split());
a = list (map (int,input().split()))
a.sort()
sum =0
for i in range (0, n):
    if mark.get(i , False) == False:
        temp =bs(i,n-1,a[i]*k);
        mark[temp] = True ;
        sum +=1
print (sum)


