#include <iostream>
#include <vector>
#include <algorithm>
#include <array>

long long int calPattern(int lower, int n, int sum, std::vector<std::vector<std::vector<long long int>>> &memo) {
	if (n == 0 && sum == 0) return 1;
	if (n == 0 && sum != 0) return 0;
	if (lower > 100) return 0;
	if (memo[lower][n][sum] < 0) {
		memo[lower][n][sum] = 0;
		for (auto i = lower; i <= 100 && i <= sum; ++i) {
			memo[lower][n][sum] += calPattern(i + 1, n - 1, sum - i, memo);
		}
	}
	return memo[lower][n][sum];
}
int main() {
	std::vector<std::vector<std::vector<long long int>>> memo(101, std::vector<std::vector<long long int>>(10, std::vector<long long int>(1001, -1)));
	int n, s;
	std::cin >> n >> s;
	while (n != 0) {
		std::cout << calPattern(0, n, s, memo) << std::endl;
		std::cin >> n >> s;
	}

}
