#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include<ext/pb_ds/hash_policy.hpp>
#include<ext/pb_ds/trie_policy.hpp>
#include<ext/pb_ds/priority_queue.hpp>
#define int long long
int n,k;
const int MAXN=1e6+5;
std::priority_queue<std::pair<int,std::pair<int,int> > > q;
int a[MAXN];
int gcd(int a,int b){
	if(b==0)return a;
	return gcd(b,(a%b));
}
signed main(){
	std::cin>>n>>k;
	for(int i=1;i<=n;i++)std::cin>>a[i];
	for(int i=1;i<=n;i++)q.push(std::make_pair(a[i],std::make_pair(i,i)));
	for(int i=1;i<=k;i++){
		std::pair<int,std::pair<int,int> > tp=q.top();
		q.pop();

		if(tp.second.second!=n){
			q.push(std::make_pair(gcd(tp.first,a[tp.second.second+1]),std::make_pair(tp.second.first,tp.second.second+1)));
		}
		std::cout<<tp.first<<'\n';
	}
	return 0;
}