ric>
#include <complex>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <cassert>
#include <iostream>
#include <iterator>
#include <algorithm>
 
using namespace std;
 
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define lengthof(x) (sizeof(x) / sizeof(*(x)))
#define FILL(ptr, value) FILL_((ptr), sizeof(ptr)/sizeof(value), (value))
template <typename T>
void FILL_(void * ptr, size_t size, T value){
  std::fill((T*)ptr, (T*)ptr+size, value);
}
//4??????????????????????????????
int dx[] ={1,0,-1,0};
int dy[] ={0,-1,0,1};
int n;//???????????°
int s;//?±??????????
int ans;
 
long long int dp[10][1010];//dp[n][s]s???n????????´??°??§??¨?????¨?????????????????????
 
int main()
{
  memset(dp,0,sizeof(dp));
  dp[0][0] = 1;
  for(int i = 0; i <101;i++){
    for(int j = 1000;j >-1;j--){
      for(int k = 9;k >0;k--){
    if(j-i>=0){
      dp[k][j] +=dp[k-1][j-i];
    }
      }
    }
  }
  while(cin >>n>>s,n||s){
    cout <<dp[n][s]<<endl;
  } 
  
  return 0;
}ric>
#include <complex>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <cassert>
#include <iostream>
#include <iterator>
#include <algorithm>
 
using namespace std;
 
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define lengthof(x) (sizeof(x) / sizeof(*(x)))
#define FILL(ptr, value) FILL_((ptr), sizeof(ptr)/sizeof(value), (value))
template <typename T>
void FILL_(void * ptr, size_t size, T value){
  std::fill((T*)ptr, (T*)ptr+size, value);
}
//4??????????????????????????????
int dx[] ={1,0,-1,0};
int dy[] ={0,-1,0,1};
int n;//???????????°
int s;//?±??????????
int ans;
 
long long int dp[10][1010];//dp[n][s]s???n????????´??°??§??¨?????¨?????????????????????
 
int main()
{
  memset(dp,0,sizeof(dp));
  dp[0][0] = 1;
  for(int i = 0; i <101;i++){
    for(int j = 1000;j >-1;j--){
      for(int k = 9;k >0;k--){
    if(j-i>=0){
      dp[k][j] +=dp[k-1][j-i];
    }
      }
    }
  }
  while(cin >>n>>s,n||s){
    cout <<dp[n][s]<<endl;
  } 
  
  return 0;
}