#include <algorithm>
#include <cstdio>

static const size_t x_max = 100, n_max = 9, s_max = 1000;
static unsigned long long dp[n_max+1][s_max+1];

int main() {
  for (;;) {
    size_t n, s;
    scanf("%zu%zu", &n, &s);
    if (!n && !s)
      return 0;
    for (size_t i = 0; i <= n; i++)
      for (size_t j = 0; j <= s; j++)
        dp[i][j] = 0;
    dp[0][0] = 1;
    size_t l = std::min(s, x_max);
    for (size_t x = 1; x <= l; x++)
      for (size_t i = n; i <= n; i--)
        for (size_t j = s; j <= s; j--) {
          dp[i][j] = dp[i][j];
          if (i && x <= j)
            dp[i][j] += dp[i-1][j-x];
        }
    printf("%llu\n", dp[n][s] + dp[n-1][s]);
  }
}