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.
class CodeforcesTask274ASolution:
    def __init__(self):
        self.result = ''
        self.n_k = []
        self.int_set = []

    def read_input(self):
        self.n_k = [int(x) for x in input().split(" ")]
        self.int_set = [int(x) for x in input().split(" ")]

    def process_task(self):
        self.int_set.sort(reverse=True)
        mults = [x * self.n_k[1] for x in self.int_set]
        sub = []
        for x in range(len(self.int_set)):
            if not mults[x] in self.int_set:
                sub.append(self.int_set[x])
        #print(len(sub), sub)
        #print(self.int_set, mults)
        self.result = str(len(sub))

    def get_result(self):
        return self.result


if __name__ == "__main__":
    Solution = CodeforcesTask274ASolution()
    Solution.read_input()
    Solution.process_task()
    print(Solution.get_result())
