#include <iostream>
#define MAX_N 10
#define MAX_S 1001
using namespace std;

int main() {
  int dp[MAX_N][MAX_S];
  for (int i = 0; i < MAX_N; i++) {
    for (int j = 0; j < MAX_S; j++) {
      dp[i][j] = 0;
    }
  }
  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 (k - i >= 0) dp[j][k] += dp[j - 1][k - i];
      }
    }
  }

  while (true) {
    int n, s;
    cin >> n >> s;
    if (n == 0 && s == 0) return 0;

    cout << dp[n][s] << endl;
  }
}