#include <stdio.h>

long dp[101][10][1001];
int n,s;

long dfs(int now,int k,int t){
    if (t < 0 || k < 0)
	return 0;
    if (now < 0) {
        if (k == 0 && t == 0)
	    return 1;
        else
	    return 0;
    }
    if(dp[now][k][t] != -1)
	return dp[now][k][t];

    dp[now][k][t] = dfs(now-1, k, t) + dfs(now-1, k-1, t-now);
    return dp[now][k][t];
}

int main(void) {
    for (int i = 0; i < 101; i++)
	for (int j = 0; j < 10; j++)
	    for (int k = 0; k < 1001; k++)
	dp[i][j][k] = -1;

    while (1) {
	scanf("%d", &n);
	scanf("%d", &s);
	if (n == 0) break;
	printf("%ld\n", dfs(100, n, s));
    }

    return 0;
}

