#include <bits/stdc++.h>

using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)

int n, s;
long long dp[10][101][1001];

//??????p????????¶ c???????????°??? sum??????????¨?
int dfs(int p, int c, int sum) {
	if (p < 0 || sum < 0) return 0; 
	if (c < 0) return p == 0 && sum == 0;
	 
	if (dp[p][c][sum] != -1) return dp[p][c][sum];
	
	return dp[p][c][sum] = dfs(p - 1, c - 1, sum - c) + dfs(p, c - 1, sum);
}

int main() {
	fill(dp[0][0], dp[10][0], -1);
	while (true) {
		cin >> n >> s;
		if (!n && !s) break;
		
		cout << dfs(n, 100, s) << endl;
	}
	return 0;
}