
#include<bits/stdc++.h>

using namespace std;

#define reps(i,f,n) for(int i=f;i<int(n);i++)
#define rep(i,n) reps(i,0,n)


typedef long long ll;

int n,s;

bool input(){
         cin>>n>>s;
	 return n!=0;
}

const int N = 101;
const int M = 10;
const int K = 1001;

ll memo[N][M][K];

ll saiki(int st, int rn, int rs){
  
  if(memo[st][rn][rs]!=-1)return memo[st][rn][rs];

  if(rn==0){
    if(rs==0)return 1;
    return 0;
  }

  ll ret = 0;
  reps(i,st,N){
    if(rs-i<0)break;
    ret += saiki(i+1, rn-1, rs-i);
  }

  //  printf("st=%d rn=%d rs=%d ret=%d\n",st,rn,rs,ret);

  return memo[st][rn][rs] = ret;
}


ll  solve(){
  rep(i,N)rep(j,M)rep(k,K)memo[i][j][k]=-1;

  return saiki(0, n, s);
}

int main(){
  while(input()){
    cout<<solve()<<endl;
  }
}