#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>

using namespace std;

#define rep(i,j) REP((i), 0, (j))
#define REP(i,j,k) for(int i=(j);(i)<(k);++i)
#define between(a,x,b) ((a)<=(x)&&(x)<=(b))
#define F first
#define S second
#define INF 1 << 30

int dp[10][1001];

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

  /*  rep(i, 10){
    rep(j, 20) printf("%d ", dp[i][j]); puts("");
    }*/
  int n, s;
  while(scanf("%d%d", &n, &s) && n+s)
    printf("%d\n", dp[n][s]);

  return 0;
}