#include <algorithm>
#include <iostream>
#include <vector>

using namespace std;

typedef long long ll;

#define reps(i,f,n) for(int i=f; i<int(n); ++i)
#define rep(i,n) reps(i,0,n)

const ll MAX = 10000000000ll;

int main()
{
    // dp[num][sum][max]
    ll dp[10][1001][101] = {{{}}};

    rep(k, 101) {
        dp[0][0][k] = 1;
        dp[1][0][k] = 1;
    }

    reps(i, 1, 10) reps(j, 1, 1001) reps(k, 1, 101){
        dp[i][j][k] = dp[i][j][k - 1];

        if(k <= j){
            dp[i][j][k] += dp[i-1][j-k][k-1];
            dp[i][j][k] = min(dp[i][j][k], MAX);
        }
    }

    int n, s;
    while(cin >> n >> s, n){
        cout << dp[n][s][100] << endl;
    }
}