#include <iostream>
using namespace std;

int main(){
	int n,s;
	while(1){
		cin >> n >> s;
		if(!n) break;
		long long int dp[101][10][1001] = {};
		dp[0][0][0] = 1;
		dp[0][1][0] = 1;
		for(int i = 1;i <= 100;i++){
			for(int j = 0;j <= n;j++){
				for(int k = 0;k <= s;k++){
					if(k - i >= 0 && j >= 1) 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];
				}
			}
		}
		cout << dp[100][n][s] << endl;
	}
	return 0;
}