#include <iostream>
#include <algorithm>
#include <cstring>

typedef long long ll;

ll dp[12][102][1001];

int s, n;

int main(){
	dp[0][0][0] = 1;

	for (int i = 0; i <= 9; ++i){
		for (int j = 0; j <= 100; ++j){
			for (int k = 0; k <= 1000; ++k){
				if (dp[i][j][k] == 0)continue;
				for (int l = j; l <= 100; ++l){
					if (k + l < 1001)dp[i + 1][l + 1][k + l] += dp[i][j][k];
				}
			}
		}
	}

	while (true){
		std::cin >> n >> s;
		if (s == 0 && n == 0)break;
		ll sum = 0;
		for (int i = 0; i <= 101; ++i)sum += dp[n][i][s];
		std::cout << sum << std::endl;
	}
	return 0;
}