#include <cstdio>

using namespace std;
typedef long long lint;

int main()
{
	int n, s;
	lint dp[10][1000] = {0};
	
	dp[0][0] = 1;
	
	for (int i = 0; i <= 100; i++){
		for (int j = 1000; j >= 0; j--){
			for (int k = 9; k >= 1; k--){
				if (j - i >= 0) dp[k][j] += dp[k - 1][j - i];
			}
		}
	}
	
	while (scanf("%d %d", &n, &s) && s){
		printf("%lld\n", dp[n][s]);
	}
	
	return (0);
}