#ifdef ONLINE_JUDGE
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#endif
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rrep(i,start,end) for (ll i = start;i >= (ll)(end);i--)
#define repn(i,end) for(ll i = 0; i <= (ll)(end); i++)
#define reps(i,start,end) for(ll i = start; i < (ll)(end); i++)
#define repsn(i,start,end) for(ll i = start; i <= (ll)(end); i++)
#define each(p,a) for(auto &p:a)
typedef vector<ll> vll;
typedef vector<pair<ll ,ll>> vpll;
typedef vector<vector<pair<ll ,ll>>> vvpll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;
typedef set<ll> sll;
typedef map<ll , ll> mpll;
typedef pair<ll ,ll> pll;
typedef tuple<ll , ll , ll> tpl3;
typedef tuple<ll , ll , ll , ll> tpl4;
typedef tuple<ll , ll , ll , ll , ll> tpl5;
typedef tuple<ll , ll , ll , ll , ll , ll> tpl6;
#define LL(...) ll __VA_ARGS__; input(__VA_ARGS__)
#define LD(...) ld __VA_ARGS__; input(__VA_ARGS__)
#define Str(...) string __VA_ARGS__; input(__VA_ARGS__)
#define Ch(...) char __VA_ARGS__; input(__VA_ARGS__)
#define all(a)  (a).begin(),(a).end()
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define sz(x) (ll)x.size()
#define fr first
#define sc second
// << std::fixed << std::setprecision(10)
const ll INF = 1LL << 60;
const ld EPS = 1e-9;
 
ll lceil(ll a,ll b){if(a%b==0){return a/b;}if(a>=0){return (a/b)+1;}else{return -((-a)/b);}}
ll lfloor(ll a,ll b){if(a%b==0){return a/b;}if(a>=0){return (a/b);}else{return -((-a)/b)-1;}}
inline ll positive_mod(ll a,ll m){return (a % m + m)%m;}
inline ll popcnt(ull a){ return __builtin_popcountll(a);}
//0indexed
inline ll topbit(ll a){assert(a != 0);return 63 - __builtin_clzll(a);}
inline ll smlbit(ll a){assert(a != 0);return __builtin_ctzll(a);}
template<class T> bool chmin(T& a, T b){if(a > b){a = b;return true;}return false;}
template<class T> bool chmax(T& a, T b){if(a < b){a = b;return true;}return false;}
template<typename T> std::istream &operator>>(std::istream&is,std::vector<T>&v){for(T &in:v){is>>in;}return is;}
template<typename T> std::ostream &operator<<(std::ostream&os,const std::vector<T>&v){for(auto it=std::begin(v);it!=std::end(v);){os<<*it<<((++it)!=std::end(v)?" ":"");}return os;}
template<typename T1, typename T2>std::ostream &operator<< (std::ostream &os, std::pair<T1,T2> p){os << "{" << p.first << "," << p.second << "}";return os;}
template<class... T>void input(T&... a){(cin >> ... >> a);}
void print(){cout << endl;}
template<class T, class... Ts>void print(const T& a, const Ts&... b){cout << a;((cout << ' ' << b), ...);cout << endl;}
template<class T> void pspace(const T& a){ cout << a << ' ';}
void perr(){cerr << endl;}
template<class T, class... Ts>void perr(const T& a, const Ts&... b){cerr << a;((cerr << ' ' << b), ...);cerr << endl;}
void yes(bool i = true){ return print(i?"yes":"no"); }
void Yes(bool i = true){ return print(i?"Yes":"No"); }
void YES(bool i = true){ return print(i?"YES":"NO"); }
template <class T> vector<T> &operator++(vector<T> &v) {for(auto &e : v) e++;return v;}
template <class T> vector<T> operator++(vector<T> &v, signed) {auto res = v;for(auto &e : v) e++;return res;}
template <class T> vector<T> &operator--(vector<T> &v) {for(auto &e : v) e--;return v;}
template <class T> vector<T> operator--(vector<T> &v, signed) {auto res = v;for(auto &e : v) e--;return res;}
//grid探索用
vector<ll> _ta = {0,0,1,-1,1,1,-1,-1};
vector<ll> _yo = {1,-1,0,0,1,-1,1,-1};
bool isin(ll now_i,ll now_j,ll h,ll w){return (0<=now_i && now_i < h && 0 <= now_j && now_j < w);}
  
ll lpow(ll x,ll n){ll ans = 1;while(n >0){if(n & 1)ans *= x;x *= x;n >>= 1;}return ans;}
ll Modlpow(ll x,ll n,ll m){ll ans = 1;ll a = x%m;while(n >0){if(n & 1){ans *= a;ans%= m;}a *= a;a %= m;n >>= 1;}return ans;} 
const ll MOD9 = 998244353LL;
const ll MOD10 = 1000000007LL;
 

//ref https://qiita.com/drken/items/3beb679e54266f20ab63#5-%E6%B4%BB%E7%94%A8%E4%BE%8B-2-%E3%83%A1%E3%83%93%E3%82%A6%E3%82%B9%E9%96%A2%E6%95%B0%E5%80%A4%E3%81%AE%E5%88%97%E6%8C%99
struct Eratosthenes{
  ll n;
  vector<bool> isprime;//素数ならtrue
  vector<ll> minfact;//xを割り切る一番小さい数
  vector<ll> mobius;// メビウス関数値
  /*
  メビウス関数u(x)とは
  u(1) = 1;
  xがある素数pで2回以上割り切れるとき、u(x) = 0;
  x = p1 * p2 * p3 * p4...pKと素因数分解できるときu(x) = (-1)^k 
  u(1)=1,u(2)=-1,u(3)=-1,u(4)=0,u(5)=-1,u(6)=1,u(7)=-1,u(8)=0,u(9)=0,u(10)=1
  */
  Eratosthenes(ll N){//O(NloglogN)
    n = N;
    isprime.resize(n+1,true);
    minfact.resize(n+1,-1);
    mobius.resize(n+1,1);
    isprime[0] = false;
    isprime[1] = false;
    minfact[1] = 1;
    for(ll p = 2;p <= n;p++){
      if(!isprime[p])continue;
      //pの情報を更新
      minfact[p] = p;
      mobius[p] = -1;
      for(ll q = p*2;q <= n;q+=p){
        isprime[q] = false;
        if(minfact[q] == -1)minfact[q] = p;
        if((q/p)%p==0)mobius[q]=0;//qはpで2回以上割れる
        else mobius[q] = -mobius[q];//反転
      }
    }
  }

  bool is_prime(ll x){
    assert(x <= n);
    return isprime[x];
  }

  //素因数分解(log(x))
  vector<pair<ll,ll>> soinsu_bunkai(ll x){
    vector<pair<ll,ll>> ret;
    while(x > 1){
      ll p = minfact[x];
      ll times = 0;//割り切れる回数
      while(minfact[x] == p){
        x/= p;
        times++;
      }
      ret.push_back({p,times});
    }
    return ret;
  }

  //約数列挙 O(約数の個数)　n <= 10^9 のとき 高々1344
  vector<ll> yakusu_rekkyo(ll x){
    vector<ll> ret;
    ret.push_back(1);
    vector<pair<ll,ll>> pf = soinsu_bunkai(x);
    for(auto &p:pf){
      ll siz = ret.size();
      for(ll i = 0;i < siz;i++){
        ll v = 1;
        for(ll j = 0;j < p.second;j++){
          v *= p.first;
          ret.push_back(ret[i]*v);
        }
      }
    }
    return ret;
  }
};

// 高速ゼータ変換
// 入力 f が in-place に更新されて、F になる
template<class T> void fast_zeta(vector<T> &f){
  ll n = f.size();
  Eratosthenes era(n);
  vector<bool> isprime = era.isprime;
  // 各素数 p 軸に対して
  // 大きい座標 (k * p) から小さい座標 (k) へと足し込む
  for(ll p = 2;p < n;p++){
    if(!isprime[p])continue;
    for(ll k = (n-1)/p;k >= 1;k--){
      f[k] += f[k * p];
    }
  }
} 
// 高速メビウス変換
// 入力 F が in-place に更新されて、f になる
template<class T> void fast_mobius(vector<T> &F){
  ll n = F.size();
  Eratosthenes era(n);
  vector<bool> isprime = era.isprime;
  // 各素数 p 軸に対して
  // 小さい座標 (k) から大きい座標 (k * p) を引いていく
  for(ll p = 2;p < n;p++){
    if(!isprime[p])continue;
    for(ll k = 1;k * p < n;k++){
      F[k] -= F[k * p];
    }
  }
}
using mint = modint;
int main(){
  ios::sync_with_stdio(false);cin.tie(nullptr);
  Eratosthenes et(3*lpow(10,6)+100);
  ll val = 100003;
  LL(n,k);
  if(n == 1){
    cout << 1 << endl;
    return 0;
  }
  mint::set_mod(val);
  ll v = n;
  ll siz = 3*lpow(10,6)+100;
  vll to(siz,-1);
  while(to[v]==-1){
    vpll ret = et.soinsu_bunkai(v);
    mint nv = 1;
    if(v == 1){
      to[v] = 1;
      continue;
    }
    for(auto [val,t]:ret){
      nv *= (mint(val).pow(t+1)-1)/(val-1);
    }
    to[v] = nv.val();
    v = nv.val();
  }
  vvll dp(61,vll(siz,-1));
  dp[0] = to;
  rep(i,60){
    rep(j,val)if(dp[i][j] != -1){
      dp[i+1][j] = dp[i][dp[i][j]];
    }
  }
  ll id = n % val;
  k--;
  rep(i,60){
    if(k >> i & 1){
      id = dp[i][id];
    }
  }
  cout << id << endl;
}