#include <iostream>
#include <algorithm>
#include <string>
#include <cmath>
#include <vector>
#include <cstdio>
#include <cstring>
#include <cstdlib>

const int MAX_X = 9;
const int MAX_N = 100;
const int MAX_S = 1000;
unsigned long long dp[MAX_N + 1 + 1][MAX_X * 2][MAX_S * 2]; // i : ?????¨?????????????????? j : ???????????§?????£????????° k : ???????????§???????¨?

int n, s;

void solve(){
    dp[0][0][0] = 1;
    
    for(int i = 0; i < MAX_N + 1; ++i){
        for(int j = 0; j < MAX_X; ++j){
            for(int k = 0; k < MAX_S; ++k){
                dp[i + 1][j + 1][k + i] += dp[i][j][k];
                dp[i + 1][j][k] += dp[i][j][k];
            }
        }
    }
    return;
}

int main(){
    
    solve();
    while(true){
    std::cin >> n >> s;
    if(n == 0 && s == 0)
        break;
    int ans = 0;
    std::cout << dp[100][n - 1][s - 1] << std::endl;
    // for(int i = 0; i < n; ++i){
    //     for(int j = 0; j < s; ++j){
    //         std::cout << dp[100][i][j] << " ";
    //     }
    //     std::cout << std::endl;
    // }
    }
    return 0;
}