#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
ll dp[11][111][1111];
ll solve(int m,int k,int s){
  if(!m) return s?0:1;
  if(s < k) return 0;
  if(k > 100) return 0;
  if(dp[m][k][s] >= 0) return dp[m][k][s];
  ll ret = solve(m,k+1,s);
  if(m && s >= k) ret += solve(m-1,k+1,s-k);
  return dp[m][k][s] = ret;
}
int main(void){
  memset(dp,-1,sizeof(dp));
  int n,s;
  while(cin >> n >> s && n){
    cout << solve(n,0,s) << endl;
  }
}