#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>
#include <fstream>

using namespace std;

#define FOR(i,a,b) for(long long i=(a);i<(b);i++)
#define REP(i,N) for(long long i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define fi first
#define se second

#define PI acos(-1.0)
#define INF 10e9+9
#define EPS 1e-10
#define MAX_N 100100
#define MAX_M 100100

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<double, double> PD;
typedef pair<string, ll> PS;
typedef vector<ll> V;
typedef pair<P, char> PC;

int n, s;
int ans = 0;
bool used[110];

void solve(int co, int k, int sum){
	if (co == n){
		if (sum == s){
			ans++;
		}
		return;
	}

	for (int i = k; i <= 100; i++){
		if (!used[i]){
			used[i] = 1;
			solve(co + 1, i, sum + i);
			used[i] = 0;
		}
	}
}

int main(){
	while (cin >> n >> s&&n + s){
		ans = 0;
		fill(used, used + 110, 0);
		solve(0, 0, 0);
		cout << ans << endl;
	}
}