#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<string>
#include<sstream>
#include<cmath>
#include<numeric>
#include<map>
#include<stack>
#include<queue>
#include<list>
using namespace std;
int inf = 1000000000;

long long int dp[101][10][1001];

int main(void) {

  dp[0][0][0] = 1;
  for(int i=1; i<=100; i++){
    for(int j=0; j<10; j++){
      for(int k=0; k<=1000; k++){
        dp[i][j][k] = dp[i-1][j][k];
        if( k - i < 0 || j == 0 ) continue;
        dp[i][j][k] += dp[i-1][j-1][k-i];
      }
    }
  }

  int n, s;
  while(cin >> n >> s){
    if( n == 0 && s == 0 ) break;
    cout << dp[100][n][s] + dp[100][n-1][s] << endl;
  }


  return 0;
}

// EOF