#include <bits/stdc++.h>
//#include<boost/multiprecision/cpp_int.hpp>
//#include<boost/multiprecision/cpp_dec_float.hpp>
//#include <atcoder/all>
#define rep(i, a) for (int i = (int)0; i < (int)a; ++i)
#define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i)
#define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define popcount __builtin_popcount
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 60;

// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

//using lll=boost::multiprecision::cpp_int;
//using Double=boost::multiprecision::number<boost::multiprecision::cpp_dec_float<1024>>;//仮数部が1024桁
template <class T>
inline bool chmin(T &a, T b)
{
	if (a > b)
	{
		a = b;
		return true;
	}
	return false;
}
template <class T>
inline bool chmax(T &a, T b)
{
	if (a < b)
	{
		a = b;
		return true;
	}
	return false;
}

template <typename T>
T mypow(T x, T n, const T &p = -1)
{ //x^nをmodで割った余り

	if(p!=-1){
		x%=p;
	}
	T ret = 1;
	while (n > 0)
	{
		if (n & 1)
		{
			if (p != -1)
				ret = (ret * x) % p;
			else
				ret *= x;
		}
		if (p != -1)
			x = (x * x) % p;
		else
			x *= x;
		n >>= 1;
	}
	return ret;
}

using namespace std;
//using namespace atcoder;

void solve()
{	
	ll n,k;
	cin>>n>>k;
	ll nn=n;
	vector<ll>dp(n+1,1);
	for(ll i=2;i*i<=n;++i){
		if(dp[i]==1){
			int cnt=1;
			ll comp=i*i;
			for(ll j=i*2;j<n;j+=i){
				ll add=0;
				ll x=j;
				while(x%i==0)x/=i,++add;
				dp[j]*=(dp[i]+add);
			}
		}
	}
	map<ll,int>mp;
	for(ll i=2;i*i<=n;++i){
		if(n%i==0){
			int cnt=0;
			while(n%i==0){
				n/=i;
				++cnt;
			}
			mp[i]=cnt;
		}
	}
	ll ans=INF;
	ll maxv=k;
	if(n>1)mp[n]=1;
	n=nn;
	for(ll i=1;i<n;++i){
		ll x=i;
		int cnt=0;
		for(auto e:mp){
			if(x%e.first==0){
				rep(j,e.second){
					if(x%e.first)break;
					x/=e.first;
					++cnt;
				}
			}
		}
		if(cnt>=k){
			if(chmax(maxv,dp[i])){
				ans=i;
			}
		}
	}
	// for(ll i=1;i<n;++i){
	// 	cout<<i<<": "<<dp[i]<<"\n";
	// }
	cout<<ans<<"\n";
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout << fixed << setprecision(15);
	solve();
	return 0;
}