#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

const ll INF = 1e11;
ll memo[10][101][1001];

void init() {
    for (int i = 0; i < 10; i++)
        for (int j = 0; j < 101; j++)
            for (int k = 0; k < 1001; k++)
                memo[i][j][k] = INF;
    memo[1][100][100] = 1;
}

ll solve(int n, int i, int s) {
    if (i > 100) return 0;
    if (memo[n][i][s] != INF) return memo[n][i][s];

    if ((n == 0 && s > 0) || (n > 0 && i > s)) return memo[n][i][s] = 0;
    if (n == 0 && s == 0) return memo[n][i][s] = 1;
    return memo[n][i][s] = solve(n - 1, i + 1, s - i) + solve(n, i + 1, s);
}

int main() {
    init();

    int n, s;
    while (scanf("%d %d", &n, &s), n)
        cout << solve(n, 0, s) << endl;

    return 0;
}
