#include<iostream>
#include<cstring>

int n, s;
long long dp[10][1001];

int main()
{
	while( std::cin >> n >> s, n | s )
	{
		memset( dp, 0, sizeof( dp ) );

		dp[0][0] = 1;
		for( int k = 0; k <= 100; ++k )
		{
			for( int j = s; j >= 0; --j )
			{
				for( int i = n; i > 0; --i )
					if( j >= k )
						dp[i][j] += dp[i-1][j-k];
			}
		}

		std::cout << dp[n][s] << std::endl;
	}

	return 0;
}