import std.string;
import std.stdio;
import std.conv;
import std.algorithm;
import std.range;

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

void main(){
    dp[0][0] = 1;
    for(int i=0;i<=100;i++){
	for(int j=9;j>=1;j--){
	    for(int k=0;k<=1000;k++){
		if(0<=i+k&&i+k<=1000)
		    dp[j][i+k] += dp[j-1][k];
	    }
	}
    }

    while(true){
	auto ss = split(readln());
	n = to!int(ss[0]);
	s = to!int(ss[1]);
	if(n == 0 && s == 0) break;
	writeln(dp[n][s]);
    }
}