类比卡特兰数。
a n s = C n + m m − C n + m m − 1 ans=C_{n+m}^{m}-C_{n+m}^{m-1} ans=Cn+mm−Cn+mm−1
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define db double
#define sg string
#define ll long long
#define rel(i,x,y) for(ll i=(x);i<(y);i++)
#define rep(i,x,y) for(ll i=(x);i<=(y);i++)
#define red(i,x,y) for(ll i=(x);i>=(y);i--)
#define res(i,x) for(ll i=head[x];i;i=nxt[i])
using namespace std;
const ll N=1e5+5;
const ll Inf=1e18;
const ll Mod=20100403;
ll n,m;
inline ll read() {
ll x=0;char ch=getchar();bool f=0;
while(ch>'9'||ch<'0'){if(ch=='-')f=1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+ch-'0';ch=getchar();}
return f?-x:x;
}
inline ll add(ll a,ll b) {
a+=b;return a>=Mod?a-Mod:a;
}
inline ll mul(ll a,ll b) {
return a*b%Mod;
}
inline ll ksc(ll a,ll b) {
ll ret=0;
while(b) {
if(b&1) ret=add(ret,a);
a=add(a,a);b>>=1;
}
return ret;
}
inline ll ksm(ll a,ll b) {
ll ret=1;
while(b) {
if(b&1) ret=mul(ret,a);
a=mul(a,a);b>>=1;
}
return ret;
}
inline ll C(ll a,ll b) {
if(a<b) return 0;
if(a==b) return 1;
b=min(b,a-b);ll ca=1,cb=1;
for(ll i=0;i<b;i++) ca=mul(ca,a-i),cb=mul(cb,b-i);
return mul(ca,ksm(cb,Mod-2));
}
inline ll lucas(ll n,ll m) {
return m==0?1:mul(C(n%Mod,m%Mod),lucas(n/Mod,m/Mod));
}
int main() {
n=read(),m=read();
printf("%lld\n",(lucas(n+m,m)-lucas(n+m,m-1)+Mod)%Mod);
return 0;
}