tyvj3481 越狱

#include<iostream>
#include<cstdio>
#include<string>
#include<cstring>
#include<algorithm>
#define ll long long
using namespace std;
ll n,m,mod = 100003;
ll q_mul(ll a,ll b,ll mod){
    ll ans = 0;
    while(b){
        if(b&1){
            b--;
            ans = (ans + a) % mod;
        }
        b >>= 1;
        a = (a + a) % mod;
    }
    return ans;
}
ll q_pow(ll a,ll b,ll mod){
    ll ans = 1;
    while(b){
        if(b&1){
            ans = q_mul(ans,a,mod);
        }
        b >>= 1;
        a = q_mul(a,a,mod);
    }
    return ans;
}
int main(){
    cin>>m>>n;
    cout<<(q_pow(m,n,mod) + mod - q_mul(m,q_pow(m-1,n-1,mod),mod))%mod;
    return 0;
}