#include <iostream>
#include <algorithm>
#include <vector>
#include <string>

using namespace std;

static int n, s;
static int num[101];
int dp[11][1001][101];
int solve(int i, int j, int k);
int main(void){

	for(int i = 0; i < 101; i++){
		num[i] = i;
	}

	while(1){
		fill_n(**dp, 11*1001*101, -1);
		cin >> n >> s;
		if(n == 0 && s == 0){break;}
		cout << solve(0,0,0) << endl;

	}
}

int solve(int cnt, int sum, int b1){
	if(cnt == n){
		if(sum == s){return 1;}
		else{return 0;}
	}
	if(dp[cnt][sum][b1] != -1){return dp[cnt][sum][b1];}
	int t = 0;
	cnt++;
	for(int i = 1; i < 101; i++){
		if(num[i] > s){break;}
		if(i < b1){continue;}
		int a = sum + num[i];
		t += solve(cnt, a, i);
	}


	return dp[cnt][sum][b1] = t;
}