#include <bits/stdc++.h>

using namespace std;

#define llong long long 
llong int n,s;
llong int ans;
llong int memo[101][10][1000];

llong int solve(int now, int d, int sum){
	int end = (s < 100 ? s : 100);

	if(now == -1){
		llong int ret = 0;
		for(int i = 0; i <= end; i++){
			ret += solve(i, 1, i);
		}
		return ret;
	}


	if(memo[now][d][sum] != -1) return memo[now][d][sum];

	if(d == n){
		if(sum == s){
			return memo[now][d][sum] = 1;
		}else return memo[now][d][sum] = 0;
	}
	if(d < n && sum >= s) return memo[now][d][sum] = 0;

	llong int ret = 0;
	for(int i = 0; i < end; i++){
		if(i <= now) continue;
		ret += solve(i, d + 1, sum + i);
	}

	return memo[now][d][sum] = ret;
}	

int main(){

	while(cin >> n >> s, n){
		fill_n(**memo, 101 * 10 *1000, -1);
		cout << solve(-1, 0, 0) << endl;
	}
	return 0;
}