#include <iostream>

using namespace std;

typedef long long ll;
const int MAX_N = 15;
const int MAX_S = 1110;
const int MAX_ADD = 110;
int n, s;
ll memo[MAX_ADD][MAX_N][MAX_S];

ll rec(ll add, ll num, ll sum)
{
    if (memo[add][num][sum] >= 0)
        return memo[add][num][sum];

    if (num == n && sum == s)
        return 1;
    if (add > 100 || sum > s || num > n)
        return 0;

    ll res = 0;
    res += rec(add + 1, num, sum);
    res += rec(add + 1, num + 1, sum + add);

    return memo[add][num][sum] = res;
}

int main()
{
    while (cin >> n >> s, n || s) {
        for (int i = 0; i < MAX_ADD; i++)
            for (int j = 0; j < MAX_N; j++)
                for (int k = 0; k < MAX_S; k++)
                    memo[i][j][k] = -1;

        cout << rec(0, 0, 0) << endl;
    }

    return 0;
}