#include <bits/stdc++.h>

#define REP(i,n) for(int i=0;i<n;i++)
#define FOR(i,a,b) for(int i=a;i<=b;i++)
#define DOWN(i,b,a) for(int i=b;i>=a;i--)

typedef long long ll;

using namespace std;


int main()
{
  ll dp[11][1001]={};
  dp[0][0] = 1;
  FOR(k,0,100) DOWN(i,10,1) FOR(j,k,1000)
    dp[i][j] += dp[i-1][j-k];
  int n, s;
  while(cin>>n>>s,n) cout << dp[n][s] << endl;
  return 0;
}