#include<bits/stdc++.h>
using namespace std;
typedef long long int lld;

int n,s;
lld dp[10][111][1111];

lld solve(int idx,int now,int sum){
  if(idx == n){
    if(sum == s) return 1;
    else return 0;
  }
  if(dp[idx][now][sum] != -1) return dp[idx][now][sum];
  lld ret = 0;
  for(int i=now;i<=100;i++){
    if(sum+i > s) break;
    ret += solve(idx+1,i+1,sum+i);
  }
  return dp[idx][now][sum] = ret;
}

int main(){
  while(cin >> n >> s, n , s){
    memset(dp,-1,sizeof(dp));
    cout << solve(0,0,0) << endl;
  } 
}