#include <iostream>
#include <cstdio>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <math.h>
#include <map>
#include <functional>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <typeinfo>
#define PI 3.14159265359
#define INF 99999999;
#define rep(i, n) for(int i=0; i<n; i++)
#define REP(n) rep(i, n)
#define EPS 1e-10
typedef long long ll;
using namespace std;
typedef pair<int, int> P;

double distanceAB(double xa, double ya, double xb, double yb);

/*
class Target
{
public:
	vector <string> draw(int n)
	{

	}
};
*/


int cnt[1000001];

int main()
{
	ll dp[15][1050];
	ll n, s;
	
	dp[0][0] = 1;
	
	for (int i=0; i<=100; i++)
	{
		for (int j=1000; j>=i; j--)
		{
			for (int k=9; k>0; k--)
			{
				dp[k][j] += dp[k-1][j-i];
			}
		}
	}
	
	while (cin >> n >> s, n | s)
	{
		cout << dp[n][s] << endl;
	}
	
	return 0;
}



double distanceAB(double xa, double ya, double xb, double yb)
{
	return sqrt((xb-xa)*(xb-xa) + (yb-ya)*(yb-ya));
}