bool M1;
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdlib>
#include<climits>
#include<iomanip>
#include<cassert>
#include<random>
#include<cstdio>
#include<vector>
#include<bitset>
#include<stack>
#include<queue>
#include<deque>
#include<cmath>
#include<ctime>
#include<map>
#include<set>
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/hash_policy.hpp>
//#include<ext/pb_ds/priority_queue.hpp>
#define fi first
#define se second
#define LD double
#define ll long long
#define Vector Point
#define I128 __int128
#define ull unsigned ll
#define pii pair<int,int>
#define pb(x) push_back(x)
#define syt cerr<<"sytakioi\n"
#define F(i,a,b) for(int i=a,i##end=b;i<=i##end;++i)
#define UF(i,a,b) for(int i=a,i##end=b;i>=i##end;--i)
#define look_memory cerr<<abs(&M2-&M1)/1024.0/1024<<'\n'
#define rd_i(l,r) uniform_int_distribution<int>(l,r)(rd)
#define rd_r(l,r) uniform_real_distribution<double>(l,r)(rd)
#define look_time cerr<<(clock()-Time)*1.0/CLOCKS_PER_SEC<<'\n'
using namespace std;
//using namespace __gnu_cxx;
mt19937 rd(time(0));
const int N=15;
ll n,k,c;
ll a[N],cnt;
inline int pw(int x){return x&1?-1:1;}
inline bool check(ll x){
	ll res=0;
	F(S,0,(1<<cnt)-1){
		ll sum=1;
		F(i,0,cnt-1) if((S>>i)&1) sum*=a[i+1];
		res+=(x/sum)*pw(__builtin_popcount(S));
	}
	return res>=k;
}
inline bool ok(ll x){
	F(i,1,cnt) if(x%a[i]==0) return 0;
	return 1;
}
bool M2;
int main(){
	int Time=clock();
	look_memory;
	cin.tie(nullptr)->sync_with_stdio(false);
	cin>>n>>k>>c;
	for(ll j=2;j*j<=n;++j) if(n%j==0){
		a[++cnt]=j;
		while(n%j==0) n/=j;
	}
	if(n>1) a[++cnt]=n;
	ll l=1,r=1e18,ans=1;
	while(l<=r){
		ll mid=(l+r)>>1;
		if(check(mid)) r=mid-1,ans=mid;
		else l=mid+1;
	}
	F(i,1,c){
		cout<<ans<<' ';
		while(!ok(++ans));
	}
	look_time;
	return 0;
}