#include <bits/stdc++.h>
#define range(i, a, b) for(int i = (a); i < (b); i++)
#define rep(i, a) range(i, 0, a)
using namespace std;

int n, s, dp[11][101][1001];

int main() {
	while (cin >> n >> s, n) {
		memset(dp, -1, sizeof(dp));
		dp[0][0][0] = 0;
		//i -> i番目、j -> 一個前の
		rep (i, n) rep (j, 101) rep (k, s + 1) {
			if (dp[i][j][k] == -1) continue;
			range (l, j + 1, 101) {
				if (k + l > s) continue;
				if (dp[i + 1][l][k + l] == -1) dp[i + 1][l][k + l] = dp[i][j][k] + 1;
				else dp[i + 1][l][k + l] += dp[i][j][k] + 1;
			}
		}
		int ans = 0;
		rep (i, 101) ans += max(dp[n][i][s], 0);
		cout << ans << endl;
	}
	return 0;
}
