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

#define ll long long
#define ull unsigned long long
#define ld  long double

using LL = long long; using ULL = unsigned long long;
using VI = vector<int>; using VVI = vector<VI>; using VVVI = vector<VVI>;
using VL = vector<LL>; using VVL = vector<VL>; using VVVL = vector<VVL>;
using VB = vector<bool>; using VVB = vector<VB>; using VVVB = vector<VVB>;
using VD = vector<double>; using VVD = vector<VD>; using VVVD = vector<VVD>;
using VC = vector<char>; using VS = vector<string>; using VVC = vector<VC>;
using PII = pair<int,int>; using PLL = pair<LL,LL>; using PDD = pair<double,double>; using PIL = pair<int,LL>;
using MII = map<int,int>; using MLL = map<LL,LL>;
using SI = set<int>; using SL = set<LL>;
using MSI = multiset<int>; using MSL = multiset<LL>;
template<class T> using MAXPQ = priority_queue<T>;
template<class T> using MINPQ = priority_queue< T, vector<T>, greater<T> >;

const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const ll INF = 1LL << 60;
#define PI  3.14159265358979323846

#define FOR(i, a, b) for(int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define EACH(e, v) for(auto &e : v)
#define RITR(it, v) for(auto it = (v).rbegin(); it != (v).rend(); ++it)
#define ALL(v) v.begin(),v.end()

vector<ll> x8={1,1,1,0,0,-1,-1,-1},y8={1,0,-1,1,-1,1,0,-1};
int dx4[4]={1,-1,0,0}, dy4[4]={0,0,1,-1};

/*
memo
-uf,RMQ(segtree),BIT,BIT2,SegTree,SegTreeLazy
-isprime,Eratosthenes,gcdlcm,factorize,divisors,modpow,moddiv
nCr(+modnCr,inverse,extend_euclid.powmod),tobaseB,tobase10
-dijkstra,Floyd,bellmanford,sccd,topological,treediamiter
-compress1,compress2,rotate90

-co,ci,fo1,fo2,fo3,fo4
-bitsearch,binaryserach
-bfs
-SegTreedec,SegTreeLazydec
*/

struct Eratosthenes{
    vector<int> isPrime;
    vector<int> minfactor;
    vector<int> mebius;

    Eratosthenes(int N){
        isPrime=vector<int>(N+1,1);
        minfactor=vector<int>(N+1,-1);
        mebius=vector<int>(N+1,1);

        isPrime[1]=0;
        minfactor[1]=1;
        for(int i = 2; i <= N; i++){
            if(isPrime[i]){
                minfactor[i] = i;
                mebius[i] = -1;
                for(int j = i*2; j <= N; j += i){
                    isPrime[j] = 0;
                    if(minfactor[j]==-1) minfactor[j] = i;
                    if((j / i) % i == 0) mebius[j] = 0;
                    else mebius[j] = -mebius[j];
                }
            }
        }
    }

    vector<pair<long long,long long>> factorize(int n){
        vector<pair<long long, long long>> res;
        while(n>1){
            int p = minfactor[n];
            int exp = 0;
            while(minfactor[n]==p){
                n /= p;
                exp++;
            }
            res.push_back({p,exp});
        }
        return res;
    }

    template<class T> void divisor_zeta(vector<T> &f){
        int N = f.size();
        for(int i = 2; i < N; i++){
            if(isPrime[i]){
                for(int j = (N - 1)/i; j >= 1; j--){
                    f[j] += f[j*i];
                }
            }
        }
    }

    template<class T> void divisor_mebius(vector<T> &f){
        int N = f.size();
        for(int i = 2; i < N; i++){
            if(isPrime[i]){
                for(int j = 1; j*i < N; j++){
                    f[j] -= f[j*i];
                }
            }
        }
    }
};

int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(0);
    ll N,K; cin >> N >> K;
    if(K==1){
        cout << N << '\n';
        return 0;
    }
    ll M = 3e6;
    Eratosthenes E(M);
    ll mod = 100003;
    ll B = 60;
    VVL dp(B+1,VL(mod));
    for(ll i = 1; i < mod; i++){
        auto v = E.factorize(i);
        ll sum = 1;
        for(auto [p,e] : v){
            ll k = e+1;
            ll q = 1;
            ll s = 0;
            while(k--){
                s += q;
                q *= p;
                s %= mod;
                q %= mod;
            }
            sum *= s;
            sum %= mod;
        }        
        dp[0][i] = sum;
    }

    for(ll i = 0; i < B; i++){
        for(ll j = 1; j < mod; j++){
            dp[i+1][j] = dp[i][dp[i][j]];
        }
    }

    auto v = E.factorize(N);
    ll sum = 1;
    for(auto [p,e] : v){
        ll k = e+1;
        ll q = 1;
        ll s = 0;
        while(k--){
            s += q;
            q *= p;
            s %= mod;
            q %= mod;
        }
        sum *= s;
        sum %= mod;
    }
    
    ll now = sum;
    K-=2;
    for(ll i = B-1; i >= 0; i--){
        if(K & 1LL<<i){
            now = dp[i][now];
        }
    }   

    cout << now << '\n';
}