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
    res= -1
    while (l1 <= r1):
         mid = (l1 + r1) // 2;

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


n,k= map (int,input().split());
a = list (map (int,input().split()))
a.sort()
l = 0
r = bs(0,n-1,a[0]*k)
crrl = 0
maxc = 0
length =  0
t= 0
if  (a[r] == a[0]*k  and r != 0 ):
    maxc = max (maxc, r)
else :
    crrl =r-1
    maxc = max (maxc,r+1)
    length = r+1
    t1 =r
# print(l, "------------", r)
# print (length)

for l in range (1,n):
    r = max (bs (r+1,n-1,a[l]*k),l)
    # print (l,"------------",r)
    if  (a[r] == a[l]*k and r != l ) :
        maxc = max (maxc ,length + r - t-1)
        length = 0
        t = l+1 ;
    else :
        length += r- t
        maxc = max (maxc,length)
        t =r
    if  (r == n ):
        break ;
# print (a)
print (maxc)


