#include <iostream>
#include <vector>
#include <list>
#include <algorithm>
#include <string>
#include <sstream>
#include <stack>
#include <iomanip>
#include <numeric>
#include <queue>
#include <climits>
#include <set>
#include <complex>
#include <cmath>
#include <cstring>
#include <map>
using namespace std;
using ll = long long;
#define MOD 1000000007
#define INF 1LL << 59

ll dp[102][15][1100];
int n, s;
int main()
{
    //std::ios::sync_with_stdio(false);
    //std::cin.tie(0);
    //cout << fixed << setprecision(7);
    memset(dp, 0, sizeof(dp));
    dp[0][0][0] = 1;
    for (int i = 1; i <= 100; ++i)
    {
        for (int j = 0; j < 15; ++j)
        {
            for (int k = 0; k <= 1000; ++k)
            {
                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 (cin >> n >> s)
    {
        if (n == 0 && s == 0)
            break;

        cout << dp[100][n][s] + dp[100][n - 1][s] << endl;
    }
    return 0;
}
