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 check(mid,A):
    i=0;c=mid
    while(i<=n-c):
        a = A[i:mid]
        #print(a,len(set(a)))
        if(len(set(a)) == c):
            return True
        i+=1;mid+=1
    return False


n,k = map(int,input().split())
A = list(map(int,input().split()))
#A.sort()
i=n-1
while(i>=0):
    if(A[i]/k in A):
        A[i]=A[i]//k
    i-=1
#print(A)
l=0;h=n
mid = (l+h)//2
ans = 0
while(l<h):
    mid = (l+h)//2
    #print(l,h)
    if(check(mid,A)):
        ans=max(ans,mid)
        l=mid+1
    else:
        h = mid
print(ans)
