#include <iostream>
#include <complex>
#include <sstream>
#include <string>
#include <algorithm>
#include <deque>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
#include <set>
#include <limits>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <ctime>
using namespace std;
#define REP(i, j) for(int i = 0; i < (int)(j); ++i)
#define FOR(i, j, k) for(int i = (int)(j); i < (int)(k); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define REVERSE(v) reverse((v).begin(), (v).end())
typedef complex<double> P;
typedef long long int Int;
const int MAX_N = 10;
const int MAX_NUM = 101;
const int MAX_S = 1001;

//do[何個使うか][いくつまで使ったか+1][合計いくつか]
Int N, S, dp[MAX_N][MAX_NUM + 5][MAX_S];

int main() {
  REP(i, MAX_N) REP(j, MAX_NUM) REP(k, MAX_S) dp[i][j][k] = 0;
  dp[0][0][0] = 1;
  REP(i, MAX_N - 1)
    REP(j, MAX_NUM)
      REP(k, MAX_S)
        FOR(l, j, MAX_NUM){
          if(k + l > MAX_S) break;
          dp[i + 1][l + 1][k + l] += dp[i][j][k];
        }
  while(cin >>N >>S && N){
    Int ans = 0;
    REP(i, MAX_NUM + 5) ans += dp[N][i][S];
    cout <<ans <<endl;
  }
  return 0;
}