#include <bits/stdc++.h>
using namespace std;

const int p = 10000;

int n, k, dp[1010][1010];

int main(){
	freopen("permut.in","r",stdin);
	freopen("permut.out","w",stdout);
    scanf("%d%d", &n, &k);
    dp[1][0] = 1;
    for (int i = 2; i <= n; i++){
        int sum = 0;
        for (int j = 0; j <= k; j++){
            (sum += dp[i - 1][j]) %= p;
            dp[i][j] = sum;
            if(j >= i - 1){
                (((sum -= dp[i - 1][j - i + 1]) %= p)+= p) %= p;
			} 
        }
    }
    printf("%d\n", dp[n][k]);
    return 0;
}