#include <bits/stdc++.h>

using namespace std;

int n,s;
long long int a[10][1001][101];

long long int solver(int d,int sum,int p){
	if(a[d][sum][p] >= 0)return a[d][sum][p];

	if(d == n){
		if(sum == s){
			return a[d][sum][p] = 1;
		}else{
			return a[d][sum][p] = 0;
		}
	}

	long long int b = 0;
	for(int i = p;i <= 100;i++){
		b += solver(d+1,sum+i,i+1);
	}
	a[d][sum][p] = b;
	return b;
}
int main(){
	while(cin >>n >>s,n){
		fill_n(**a,10*1001*101,-1);
		cout << solver(0,0,0) << endl;
	}
	return 0;
}