#ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using ll=long long;
using ld=long double;
using st=string;
using P=pair<ll,ll>;
typedef atcoder::modint mint;
ll inf=9e18;
template<class... T>
constexpr auto max(T... a){return max(initializer_list<common_type_t<T...>>{a...});}
template<class... T>
constexpr auto min(T... a){return min(initializer_list<common_type_t<T...>>{a...});}
template<typename T, int s, int i = 0>
auto vec(const ll (&sizes)[s], const T& init = T()){
  if constexpr(i < s) return vector(sizes[i], vec<T, s, i+1>(sizes, init));
  else return init;
}


ll fsqrt(ll x){
  ll i=sqrt(x);
  while (i*i>x) i--;
  while ((i+1)*(i+1)<=x) i++;
  return i;
}

ll sum_divisor(ll n){
  ll ans=0;
  for(ll i=1;i<=fsqrt(n);i++){
    if(n%i==0){
      ans+=i;
      if(i*i!=n) ans+=n/i;
      ans%=100003;
    }
  }
  return ans;
}


int main(){
  ll n,k;
  cin>>n>>k;
  k--;
  auto memo=vec<ll>({100003},0);
  deque<ll> v;
  while(v.size()!=k){
    if(n<100003&&memo[n]!=0){
      // cout<<n<<"y\n";
      while(v.front()!=n){
        v.pop_front();
        k--;
      }
      cout<<v[(k+1)%v.size()]<<"\n";
      return 0;
    }else{
      // cout<<n<<"\n";
      if(n<100003){
        memo[n]=sum_divisor(n);
        n=memo[n];
      }else{
        n=sum_divisor(n);
      }
      v.push_back(n);
    }
  }
  cout<<n<<"\n";
}