/*
    题解：http://blog.csdn.net/wzq_qwq/article/details/48706151 
*/ 
#include<iostream>
#include<cstdio>
#define N 2000010
#define mod 20100403
#define lon long long
using namespace std;
lon inv[N],jc1[N],jc2[N];
void init(){
    jc1[0]=1;for(int i=1;i<N;i++) jc1[i]=(jc1[i-1]*i)%mod;
    inv[0]=inv[1]=1;for(int i=2;i<N;i++) inv[i]=(mod-mod/i)*inv[mod%i]%mod;
    jc2[0]=1;for(int i=1;i<N;i++) jc2[i]=(jc2[i-1]*inv[i])%mod;
}
lon get_c(int n,int m){
    return ((jc1[n]*jc2[m])%mod*jc2[n-m])%mod;
}
int main(){
    init();
    int n,m;scanf("%d%d",&n,&m);
    cout<<(get_c(n+m,m)-get_c(n+m,m-1)+mod)%mod;
    return 0;
}