# define _CRT_SECURE_NO_WARNINGS 1
# include <iostream>
# include <string>
# include <vector>
# include <algorithm>
# include <cstdlib>
# include <cstdio>
# include <cstring>
# include <cstdlib>
# include <iomanip>
# include <queue>
# include <sstream>
# include <climits>
# include <cmath>
# include <list>
# include <functional>
# include <map>
# include <stack>
using namespace std;
# define M_PI 3.141592
# define FOR(i,n) for(int i=0;i<(int)n;i++)
# define FORI(i,k,n) for(int i=k;i<(int)n;i++)
# define toRad 2.0*M_PI/360.0
# define inin(x) int x;cin>>x;
# define all(x) x.begin(),x.end()
# define debug(x) cout<<#x<<" :"<<x<<endl;
# define rep(i,n) for(int i=0;i<(int)n;i++)
# define EPS 1e-12
# define pri_max 60000
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef vector<int> vi;
typedef vector<vi> vvi;

long long memo[10][101][1001];

long long dp(int now, int x, int sum)
{
	if (sum == 0 && now == 0)return 1;
	if (now < 0 || x < 0 || sum < 0)return 0;
	if (memo[now][x][sum] != -1)return memo[now][x][sum];
	long long ans = 0;
	ans = dp(now - 1, x - 1, sum - x) + dp(now, x - 1, sum);
	return memo[now][x][sum] = ans;
}



int main()
{
	memset(memo, -1, sizeof memo);
	int n, s;
	while (cin >> n >> s&&n)
		cout << dp(n, 100, s) << endl;
}