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.
dane = input().split(" ")
k = int(dane[1])
liczby = list(map(int,input().split(" ")))
akcept = []
odrz = []
klu = []
klulista = []
for n in liczby:
    if n * k not in liczby and n / k not in liczby:
        akcept += [n]
    elif n * k in liczby:
        klu += [n,n*k]
        klulista += [[n,n*k]]
for n in klulista:
    c1 = klu.count(n[0])
    c2 = klu.count(n[1])
    if n[0] in odrz:
        akcept += [n[1]]
        odrz += [n[0]]
        continue
    if n[1] in odrz:
        akcept += [n[0]]
        odrz += [n[1]]
        continue
    if c1 > c2 and n[0] not in akcept:
        akcept += [n[1]]
        odrz += [n[0]]
        continue
    elif n[0] in akcept:
        odrz += [n[1]]
        continue
    if c1 <= c2 and n[1] not in akcept:
        akcept += [n[0]]
        odrz += [n[1]]
        continue
    elif n[1] in akcept:
        odrz += [n[0]]
        continue
print(len(akcept),akcept)
    

    
   