    #include <iostream>
     
    //dp[i][j][k] : i個j+1番まで選んだ時、和がkとなる場合の数
    int dp[10][102][1001] = {0};
    int main(void) {
    //std::ifstream ifs("input.txt");
    int N, S;
    do {
    std::cin >> N >> S;
    if (N == 0 && S == 0) break;
     
    for (int i = 0; i <= N; i++) {
    for (int j = 0; j <= 101; j++) {
    for (int k = 0; k <= S; k++) {
    dp[i][j][k] = 0;
    }
    }
    }
    for (int j = 0; j <= 101; j++) {
    dp[0][j][0] = 1;
    }
    for (int i = 1; i <= N; i++) {
    for (int j = 1; j <= 101; j++) {
    for (int k = 0; k <= S; k++) {
    if (k - (j-1) >= 0) {
    dp[i][j][k] += dp[i - 1][j - 1][k - (j - 1)];
    }
    dp[i][j][k] += dp[i][j - 1][k];
    }
    }
    }
    std::cout << dp[N][101][S] << std::endl;
     
    } while (1);
    return 0;
    }