#include <bits/stdc++.h>
using namespace std;

#define int long long
#define rep(i,l,r) for(int i=(int)(l);i<(int)(r);i++)
#define all(x) (x).begin(),(x).end()
template<class T>bool chmax(T &a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T &a,T b){if(a>b){a=b;return 1;}return 0;}

typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;

const int inf = 1LL<<60;
const int mod = 1e9 + 7;
const double eps = 1e-9;

/*{
  }*/

int Pow(int b, int p){
  if(p == 0) return 1;
  return Pow(b*b, p/2)*(p%2 ? b : 1);
}

signed main(){
  int n, k;
  cin >> n >> k;

  int t = n;
  vector<pii> pf;
  rep(i, 2, t/i+1){
    int c = 0;
    while(t%i == 0){ c++; t /= i; }
    if(c) pf.emplace_back(i, c);
  }
  if(t != 1) pf.emplace_back(t, 1);

  int m = pf.size();
  vi v(m), z(n+1);
  int cur = 0;
  while(k){
    if(v[cur] < pf[cur].second){
      v[cur]++;
      z[pf[cur].first]++;
      k--;
    }
    cur = (cur+1)%m;
  }

  int ans = 1;
  rep(i, 0, m){
    ans *= Pow(pf[i].first, v[i]);
  }

  vi p(n+1, 1);
  rep(i, 2, n+1){
    rep(j, 2, n/i+1){
      p[i*j] = 0;
    }
  }

  rep(i, 0, 30){
    for(int j = 2; ans * j < n; j++){
      if(p[j] and z[j] <= i){
        ans *= j;
        z[j]++;
      }
    }
  }

  cout << ans << endl;

//  rep(i, 0, n+1) if(z[i]) cout << i << " " << z[i] << endl;

  return 0;
}