#include<bits/stdc++.h>
#define Code using
#define by namespace
#define qwqSW std
#define int long long
Code by qwqSW;

inline int read(){
	int x=0;char c=getchar();
	while(c<48) c=getchar();
	while(c>47) x=(x<<1)+(x<<3)+c-48,c=getchar();
	return x; 
}

const int N=1314;
const int K=1314;
const int mod=10000;
int n,k,dp[N][K],sum[N][K];

signed main(){
	n=read(),k=read();
	dp[1][0]=1;sum[1][0]=1; 
	//for(int i=1;i<=n;i++){
	//	dp[i][0]=1;sum[i][0]=1;
	//}
	for(int i=2;i<=n;i++){
		for(int j=0;j<=k;j++){//
			if(j>i-1){
				dp[i][j]=(sum[i-1][j]-sum[i-1][j-i]+mod)%mod;//
			}
			else{
				dp[i][j]=sum[i-1][j]%mod;
			}
			sum[i][j]=(sum[i][j-1]+dp[i][j])%mod;//
		}
	}
	printf("%lld",dp[n][k]%mod);//
	return 0;
}

rt，和题解对拍过了但就是调不出来，样例输出2，求求各位dalao了qwq