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.
# 2022-09-17 16:27:22.421726
# https://codeforces.com/problemset/problem/274/A
import sys
from collections import Counter

_DEBUG = True
if not _DEBUG:
    input = sys.stdin.readline
    # print = sys.stdout.write


def proc(n, k, a):
    a = sorted(a)
    s = set(a)
    visited = set()
    group_cnt = 0

    for e in a:
        if e in visited:
            continue
        group_cnt += 1

        x = e
        while x <= 10 ** 5:
            if x in s:
                visited.add(x)
            x *= k

    return group_cnt


n, k = map(int, input().split())
a = list(map(int, input().split()))

ans = proc(n, k, a)
print(ans)
