#include <iostream>
#include <algorithm>
#include <fstream>
using namespace std;
int n, pos = 0, k, k_copy, x, v[101];
int main() {
ifstream fin("puterik.in");
ofstream fout("puterik.out");
cin >> n >> k;
for (int i = 1; i <= n; ++i) {
cin >> x;
k_copy = k;
while (k_copy < x) {
k_copy = k_copy * k;
}
if (k_copy == x || x == 1) {
++pos;
v[pos] = x;
}
}
sort (v, v + pos + 1);
for (int i = 1; i <= pos; ++i) {
cout << v[i] << ' ';
}
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8YWxnb3JpdGhtPgojaW5jbHVkZSA8ZnN0cmVhbT4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKIAppbnQgbiwgcG9zID0gMCwgaywga19jb3B5LCB4LCB2WzEwMV07CiAKaW50IG1haW4oKSB7CiAgICBpZnN0cmVhbSBmaW4oInB1dGVyaWsuaW4iKTsKICAgIG9mc3RyZWFtIGZvdXQoInB1dGVyaWsub3V0Iik7CiAgICBjaW4gPj4gbiA+PiBrOwogICAgZm9yIChpbnQgaSA9IDE7IGkgPD0gbjsgKytpKSB7CiAgICAgICAgY2luID4+IHg7CiAgICAgICAga19jb3B5ID0gazsKICAgICAgICB3aGlsZSAoa19jb3B5IDwgeCkgewogICAgICAgICAgICBrX2NvcHkgPSBrX2NvcHkgKiBrOwogICAgICAgIH0KICAgICAgICBpZiAoa19jb3B5ID09IHggfHwgeCA9PSAxKSB7CiAgICAgICAgICAgICsrcG9zOwogICAgICAgICAgICB2W3Bvc10gPSB4OwogICAgICAgIH0KICAgIH0KICAgIHNvcnQgKHYsIHYgKyBwb3MgKyAxKTsKICAgIGZvciAoaW50IGkgPSAxOyBpIDw9IHBvczsgKytpKSB7CiAgICAgICAgY291dCA8PCB2W2ldIDw8ICcgJzsKICAgIH0KICAgIHJldHVybiAwOwp9