#include<bits/stdc++.h>
#define gt getchar
#define pt putchar
#define int long long
#define ull unsigned long long
#define fst first
#define snd second
#define mkp(x,y) make_pair(x,y)
#define L(x) x<<1
#define R(x) x<<1|1
using namespace std;
typedef pair<int,int> pii;
const double eps=1e-6;
inline bool pts(char ch){return ch>=48&&ch<=57;}
inline int read(){
	bool f=0;int x=0;char ch;
	ch=gt();
	while(!pts(ch)&&ch!=EOF){if(ch=='-')f=1;ch=gt();}
	while(pts(ch)){x*=10;x+=(ch-48);ch=gt();}
	if(f)return -x;
	else return x;
}
template<class T>
inline void print(T x){
	char s[114];
	int top=0;
	if(x<0)pt('-');
	do{
		top++;
		if(x>=0)s[top]=(x%10)+48;
		else s[top]=(-(x%10)+48);
		x/=10;
	}while(x);
	while(top){pt(s[top]);top--;}
}
struct segment{int l,r;};
bool operator<(segment a,segment b){if(a.l!=b.l)return a.l>b.l;else return a.r>b.r;}
int gcd(int x,int y){return y==0?x:gcd(y,x%y);}
priority_queue<pair<int,segment> >h;
int a[1000005];
signed main(){
	int n=read(),k=read();
	for(int i=1;i<=n;i++){
		a[i]=read();
		segment tmp={i,i};
		h.push(mkp(a[i],tmp));
	}
	while(k--){
		auto top=h.top();
		h.pop();
		cout<<top.fst<<'\n';
		if(top.snd.r+1<=n){
			segment tmp={top.snd.l,top.snd.r+1};
			h.push(mkp(gcd(top.fst,a[top.snd.r+1]),tmp));
		}
	}
	return 0;
}