#include<iostream>

using namespace std;

#define rep(i, n) for (int i = 0; i < int(n); ++i)

long long mem[10][102][1001];

long long solve(int a, int b, int c) {
  if (mem[a][b][c] != -1) return mem[a][b][c];
  if (a == 0) return 0;
  mem[a][b][c] = 0;
  rep (i, b) mem[a][b][c] += solve(a - 1, i, c - i);
  return mem[a][b][c];
}

int main() {
  int n, s;
  while (cin >> n >> s, n) {
    rep (i, n + 1) rep (j, 102) rep (k, s + 1) mem[i][j][k] = -1;
    rep (i, 102) mem[0][i][0] = 1;
    cout << solve(n, 101, s) << endl;
  }
  return 0;
}