#include <bits/stdc++.h>
#define repq(i,a,n) for(int i=a; i<=n; i++)
int dp[110][20][1010];
signed main() {
    int n, s;
    memset(dp, 0, sizeof(dp)); dp[0][0][0] = 1;
    repq(i,1,100) repq(j,0,15) repq(k,0,1000) {
        dp[i][j][k] = dp[i-1][j][k];
        if(k - i < 0) continue;
        if(j != 0) dp[i][j][k] += dp[i-1][j-1][k-i];
    }
    while(std::cin >> n >> s, n || s)
        std::cout << dp[100][n][s] + dp[100][n-1][s] << std::endl;
    return 0;
}