#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

long long dp[10][1001];

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

 
  int n, s;
  while(scanf("%d%d", &n, &s) && n+s)
    printf("%lld\n", dp[n][s]);

  return 0;
}