#include <cstdio>
#include <algorithm>

int  n, s;
long long dp[10][101][1001];

long long solve(int cnt, int sum, int num){
    if(cnt < 0 || sum < 0) return 0;
    if(num < 0) return cnt == 0 && sum == 0;

    if(dp[cnt][num][sum] != -1) return dp[cnt][num][sum];

    return dp[cnt][num][sum] = solve(cnt - 1, sum - num, num - 1) + solve(cnt, sum, num - 1);
}

int main(){
    std::fill(dp[0][0], dp[10][0], -1);

    while(scanf("%d %d", &n, &s) != EOF){
        if(n == 0 && s == 0) break;

        printf("%d\n", solve(n, s, 100));
    }

    return 0;
}