#include <iostream>
#include <stdio.h>
#include <string.h>
#include <string>
#include <algorithm>
using namespace std;

long long int dp[11][1001];
void q97() {
	dp[0][0] = 1;
	for (int i = 0; i < 101; i++) {
		for (int j = 9; j >= 0; j--) {
			for (int k = 0; i + k < 1001; k++) {
				dp[j + 1][k + i] += dp[j][k];
			}
		}
	}

	int n, s;
	for (; cin >> n >> s;) {
		if (!n && !s) break;
		cout << dp[n][s] << endl;
	}
}

int main() {
	q97();
	return 0;
}