#include<iostream>
#include<sstream>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<complex>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cassert>

#define rep(i,n) for(int i=0;i<(int)n;i++)
#define all(c) (c).begin(),(c).end()
#define mp make_pair
#define pb push_back
#define each(i,c) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();i++)
#define dbg(x) cerr<<__LINE__<<": "<<#x<<" = "<<(x)<<endl

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
const int inf = (int)1e9;
const double INF = 1e12, EPS = 1e-9;

int n, s;
ll dp[9][101][1010];

int main(){
	
	rep(i, 101) dp[0][i][i] = 1;
	rep(i, 8) rep(j, 101) rep(k, 1010) if(dp[i][j][k]){
		for(int l = j + 1; l < 101 && l + k < 1010; l++)
		dp[i + 1][l][k + l] += dp[i][j][k];
	}
	
	while(cin >> n >> s, n){
		ll ans = 0;
		rep(i, 101) ans += dp[n - 1][i][s];
		cout << ans << endl;
	}
	return 0;
}