#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define MAXN 1010
#define mod 10000
// By flyfreemrn
inline ll read(){
	ll x=0,f=1;
	char c=getchar();
	while(c<'0'||c>'9'){
		if(c=='-')f=-1;
		c=getchar();
	}
	while(c>='0'&&c<='9'){
		x=x*10+c-'0';
		c=getchar();
	}
	return x*f;
}
inline void write(ll x){
	if(x>9)write(x/10);
	putchar(x%10+'0');
}
ll dp[MAXN][MAXN],pre[MAXN];
ll n,k;
int main(){
	freopen("permut.in","r",stdin);
	freopen("permut.out","w",stdout);
	n=read(),k=read();
	dp[1][0]=1;
	for(int i=2;i<=n;i++){
		pre[0]=1;
		for(int j=1;j<=k;j++)pre[j]=(pre[j-1]+dp[i-1][j])%mod;
		for(int j=1;j<=k;j++){
			dp[i][j]=(pre[j]-((j-i<0)?0:pre[j-i])+mod)%mod;
		}
	}
	cout<<dp[n][k];
	return 0;
}