#include
#include
#include
using namespace std;
#define ll long long int
bool arr[100004];
vectorprime;
int main() {
ll num;
num = 100001;
arr[2] = true;
prime.push_back(2);
for (ll i = 3; i < num; i = i + 2)
{ arr[i] = true; }
for (ll i = 3; i < num; i = i + 2)
{
if (arr[i]) {
prime.push_back(i);
for (ll j = i * i; j < num; j = j + i)
arr[j] = false;
}
}
int size, q;
cin>>size>>q;
list v;
for(int i=0; i<size; i++)
{
int val;
cin>>val;
v.push_back(val);
}
list A(v), B;
for(int j=0; j<q; j++)
{
size = A.size();
for(int i=0; i<size; i++)
{
int val = A.front();
A.pop_front();
if(val%prime[j]==0)
{
B.push_back(val);
}
else
{
A.push_back(val);
}
}
for(auto x: B){cout<<x<<endl;}
B.clear();
}
for(auto x: A){cout<<x<<endl;}
return 0;
}