#include <stdio.h>

typedef long ll;

ll memo[10][1010];
ll dfs(int n, int s, int x)
{
	ll pat = 0;
	if (n == 0) return s == 0;
	if (s < 0) return 0;
	if (x > 100) return 0;
	if (memo[n][s] != -1) return memo[n][s];
	
	for (; x <= 100; x++){
		pat += dfs(n - 1, s - x, x + 1);
	}
	return pat;
}

int main(void)
{
	int N, S;
	while (scanf("%d %d", &N, &S), N || S){
		memset(memo, -1, sizeof(memo));
		printf("%ld\n", dfs(N, S, 0));
	}
	return 0;
}