#include<cstdio>

#include<cstring>

#include<algorithm>

#define ll long long

#define mod 100003

using namespace std;

ll pow_mod(ll n,ll p)

{

    ll ans=;

    while(p)

    {

        if(p&) ans=ans*n%mod;

        n=n*n%mod;

        p>>=;

    }

    return ans;

}

int main()

{

    ll n,m;

    scanf("%lld%lld",&n,&m);

    ll x=pow_mod(n,m);

    ll y=pow_mod(n-,m-);

    ll ans=(x+mod-y*n%mod)%mod;

    printf("%lld\n",ans);

    return ;

}