#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <bitset>
 
#define rep(i, n) for(int i = 0; i < (n); i++)
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define all(v) (v).begin(), (v).end()
#define rev(s) (s).rbegin(), (s).rend()
#define MP make_pair
#define X first
#define Y second
 
using namespace std;
 
typedef long long ll;
typedef pair<int, int> P;
using namespace std;

ll memo[11][110][1010];
ll sub(int n, int k, int s){
	if(n == 0) return (s == 0);
	if(memo[n][k][s] != -1) return memo[n][k][s];

	ll sum = 0;
	rep(i, k){
		if(i > s)break;
		//printf("call sub(%d,%d,%d)/ret=%d\n", n-1, i, s-i, sub(n-1, i, s-i));
		sum += sub(n-1, i, s-i);
	}
	return memo[n][k][s] = sum;
}

int main(){
	memset(memo, -1, sizeof(memo));
	int n, s;
	while(cin >> n >> s, n+s){
		cout << sub(n, 101, s) << endl;
	}

	return 0;
}