#include <cstring>

#include <cstdio>

#include <algorithm>

#include <cstdlib>

#include <cmath>

using namespace std;

typedef long long LL;

const LL mod=20100403;

const int N=2000005;

int n,m;

LL fac[N];

LL Pow(LL x,LL y){

	if (y==0)

		return 1LL;

	LL xx=Pow(x,y/2);

	xx=xx*xx%mod;

	if (y&1LL)

		xx=xx*x%mod;

	return xx;

}

LL Inv(LL x){

	return Pow(x,mod-2);

}

LL C(LL n,LL m){

	return fac[n]*Inv(fac[m])%mod*Inv(fac[n-m])%mod;

}

int main(){

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

	fac[0]=1;

	for (LL i=1;i<=n+m;i++)

		fac[i]=fac[i-1]*i%mod;

	printf("%lld",(C(n+m,m)-C(n+m,m-1)+mod)%mod);

	return 0;

}