
import std.stdio, std.conv, std.string, std.algorithm;
import std.array, std.conv, std.c.string;
 
long[1001][10] dp;

void init_dp(int comb, int limit) {  
  dp[0][0] = 1;
  for(long i = 0; i <= 100; i++)
    for(long j = limit; j >= 0; j--)
      for(long k = comb; k >= 1; k--)
        if (j - i >= 0) {
          dp[k][j] += dp[k - 1][j - i];
        }
}
 
void main() {
  init_dp(9, 1000);
  while(true) {
    int n, m;
    readf("%d %d\n", &n, &m);
    if ((n + m) == 0) break;
    dp[n][m].writeln;
  }
}