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.
import sys
n,k=input().split()

n=int(n)
k=int(k)

s=sys.stdin.readline().split()
seq=[]
if(k==1):
    print(n)
else:
    for i in range(n):
        s[i]=int(s[i])
        if(s[i]%k==0):
            seq.append(s[i])
    seq.sort()
    q=True
    x=0
    while(q):
        m=len(seq)
        q=False
        for i in range(x,m):
            if(seq[i]//k in s):
                s.remove(seq[i])
                seq.pop(i)
                x=i
                q=True
                break

    print(len(s))
    
        
