#include<bits/stdc++.h> #define ll long long using namespace std; const int maxn=1e7+10; ll n,m,t,k,cnt[maxn],tot=0,root,ans[maxn]; ll rnd[maxn],siz[maxn],value[maxn],num[maxn]; priority_queue<ll> q; int main(){ freopen("trans.in","r",stdin); freopen("trans.out","w",stdout); memset(ans,0,sizeof(ans)); scanf("%lld%lld%lld",&n,&m,&k); if(n==1){ printf("1"); fclose(stdin); fclose(stdout); return 0; } if(m>=k){ printf("%lld",k); fclose(stdin); fclose(stdout); return 0; } if(m<=5&&n<=100){ ans[1]=n; tot=1; while(m--){ int tmp=0; for(int i=1;i<=tot;i++){ // cout<<tmp<<endl; if(tmp>=k) break; for(int j=1;j*j<=ans[i];j++){ if(ans[i]%j!=0) continue; // cout<<j<<endl; q.push(-j); if(j*j!=ans[i]) q.push(-(ans[i]/j)); } while(!q.empty()){ cnt[++tmp]=q.top(); q.pop(); if(tmp==k) break; } } while(!q.empty()) q.pop(); tot=tmp; for(int i=1;i<=tmp;i++) ans[i]=-cnt[i]; } ll sum=0; for(int i=1;i<=tot;i++) sum+=ans[i]; printf("%lld",sum); fclose(stdin); fclose(stdout); return 0; } for(ll i=1;i*i<=n;i++){ if(n%i!=0) continue; // cout<<i<<endl; num[++tot]=i; if(i*i!=n) num[++tot]=n/i; } // cout<<tot<<endl; int cnt1=tot; sort(num+1,num+1+tot); for(int i=1;i<=tot;i++) ans[i]=num[i]; m--; while(m--){ int tmp=0; for(int i=1;i<=tot;i++){ if(tmp>=k) break; for(int j=1;j<=cnt1;j++){ if(num[j]>ans[i]||tmp>=k) break; if(ans[i]%num[j]==0) cnt[++tmp]=num[j]; } } tot=tmp; ll sum=0; for(int i=1;i<=tmp;i++) ans[i]=cnt[i],sum+=ans[i]; // printf("%lld\n",sum); } ll sum=0; // cout<<tot<<endl; for(int i=1;i<=tot;i++) sum+=ans[i]; printf("%lld",sum); return 0; }