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 rd(n):
    if n==0:
        return input("")
    if n==1:
        return int(input())
    if n==2:
        return map(int,input().split())
    if n==3:
        return list(map(int,input().split()))
def solve():
    n,k=map(int,input().split())
    A=list(map(int,input().split()))
    B=[[],[]]
    for i in range(n):
        x=A[i]
        if(x*k in A):
            B[0].append(x)
            B[1].append(x*k)
        elif(x not in B[1]):
            B[0].append(x)
            B[1].append(x)
    if(len(B[0])>len(B[1])):
        for ele in B[0]:
            print(ele,end=" ")
    else:
        for ele in B[1]:
            print(ele,end=" ")

solve()
