
#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cctype>
#include<math.h>
#include<string>
#include<string.h>
#include<stack>
#include<queue>
#include<vector>
#include<utility>
#include<set>
#include<map>
#include<stdlib.h>
#include<iomanip>

using namespace std;

#define ll long long
#define ld long double
#define EPS 0.0000000001
#define INF 1e9
#define MOD 1000000007
#define rep(i,n) for(i=0;i<(n);i++)
#define loop(i,a,n) for(i=a;i<(n);i++)
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)

typedef vector<int> vi;
typedef vector<string> vs;
typedef pair<int,int> pii;

ll dp[2][105][6000];

int main(void) {
  int i,j,k;
  int n,s;
  while(1){
    cin>>n>>s;
    if(n==0)break;
    rep(i,2)rep(j,101)rep(k,6000)dp[i][j][k]=0;
    dp[0][0][0]=1;

    rep(i,101)rep(j,101)rep(k,s+1)if(dp[i%2][j][k]>0){
      dp[(i+1)%2][j][k]+=dp[i%2][j][k];
      dp[(i+1)%2][j+1][min(k+i,s+1)]+=dp[i%2][j][k];
      dp[i%2][j][k]=0;
    }
    cout<<dp[i%2][n][s]<<endl;
  }
}
