#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
#define MOD 1000000007
#define INF (1LL<<25)     //33554432
#define PI 3.14159265359
#define EPS 1e-12
#define int ll

ll dp[105][15][1010];

int dfs(int n, int m, int k) {
  if(m<0||k<0) return 0;
  if(n<0) {
    if(!k&&!m) return 1;
    else return 0;
  }
  if(dp[n][m][k] != -1) return dp[n][m][k];

  return dp[n][m][k] = dfs(n-1, m, k) + dfs(n-1, m-1, k-n);
}

signed main(void)
{
  int n, s;
  fill(dp[0][0], dp[105][0], -1);
  while(cin>>n>>s, n||s) cout << dfs(100, n, s) << endl;
  return 0;
}