#include<iostream>
#include<algorithm>
#include<string>
#include<vector>
#include<cmath>
#define int long long
#define mod 1000000007
#define for0(i, n) for(int i = 0; i < (n); i++)
#define for1(i, n) for(int i = 1; i <= (n);i++)
using namespace std;
int dp[101][11][1001];
signed main() {
	dp[0][0][0] = 1;
	dp[0][1][0] = 1;
	for1(i, 100) {
		for0(j, 11) {
			for0(k, 1001) {
				if (j >= 1 && k - i >= 0)dp[i][j][k] = dp[i - 1][j][k] + dp[i - 1][j - 1][k - i];
				else dp[i][j][k] = dp[i - 1][j][k];
			}
		}
	}
	int a, b; while (cin >> a >> b, a)cout << dp[100][a][b] << endl;
}
