rt.

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll p=20100403;
const int N=2000010;
ll n,m;
ll f[N],inf[N];
ll qpow(ll x,ll n,ll p){
	if(n==0)return 1;
	ll r=1;
	x%=p;
	while(n!=0){
		if(n&1){
			r=(r*x)%p;
		}
		x=(x*x)%p;
		n>>=1;
	} 
	return r%p;
}
ll C(ll n,ll m){
	if(n==m||m==0)return 1;
	if(n<m)return 0;
	return f[n]*inf[n-m]%p*inf[m]%p;
}
int main(){
	f[0]=1,inf[0]=1;
	for(ll i=1;i<=1000000;i++){
		f[i]=f[i-1]*i%p;
		inf[i]=inf[i-1]*qpow(i,p-2,p)%p;
	}
	ll n,m;
	cin>>n>>m;
	cout<<(C(n+m,m)-C(n+m,m-1)+p)%p;
	return 0;
}