#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
ll memo[102][1001];

ll rec(int n, int s, int index) {
  if(memo[n][s]) return memo[n][s];
  if(index >= 101) return 0;
  if(n < 0) return 0;
  if(n == 0) return s == 0;
  if(s <= 0) return 0;
  
  return memo[n][s] = rec(n-1, s-index, index+1) + rec(n, s, index+1);
}

int main() {
  int n, s;
  
  while(cin >> n >> s && n+s) {
	cout << rec(n, s, 0) << endl;
  }
  
  return 0;
}