#include using namespace std; #define F first #define S second #define R cin>> #define Z class #define ll long long #define ln cout<<'\n' #define in(a) insert(a) #define pb(a) push_back(a) #define pd(a) printf("%.10f\n",a) #define mem(a) memset(a,0,sizeof(a)) #define all(c) (c).begin(),(c).end() #define iter(c) __typeof((c).begin()) #define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--) #define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++) #define rep(i,n) REP(i,0,n) #define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++) templatevoid pr(A a){cout<void pr(A a,B b){cout<void pr(A a,B b,C c){cout<void pr(A a,B b,C c,D d){cout<void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<=0&&x=0&&y P; void Main() { ll n,k; cin >> n >> k; ll N=n; vector v; for(ll i=2; i*i<=n; i++) { while(n%i==0) { n/=i; v.pb(i); } } if(n>1) v.pb(n); sort(all(v)); ll ans=1,M=1; rep(i,N) { ll c=0; ll x=i; rep(j,v.size()) { if(x%v[j]==0) { x/=v[j]; c++; } } if(c>=k) { ll cnt=0; for(int j=1; j*j<=i; j++) { if(i%j==0) { cnt++; if(i/j!=j) cnt++; } } if(M