
#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 = 100;
const int M = 9;
const int S = 1000;

int memo[N+11][M+11][S+11];

ll saiki(int st, int rn, int val){

  if(memo[st][rn][val]!=-1)return memo[st][rn][val];

  if(rn<=0){
    if(val==0)return 1;
    return 0;
  }


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

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

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

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

  return saiki(0, n, s);
}

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