#include<bits/stdc++.h>
using namespace std;

#define lint long long
#define P pair<int, int>
#define LLP pair<long long, long long>
#define REP(i, x, n) for(int i = (x), i##_len = (int)(n) ; i < i##_len ; ++i)
#define rep(i, n) for(int i = 0, i##_len = (int)(n) ; i < i##_len ; ++i)
#define repr(i, n) for(int i = (int)(n) - 1 ; i >= 0 ; --i)
#define SORT(x) sort((x).begin(), (x).end())
#define SORT_INV(x) sort((x).rbegin(), (x).rend())

const int IINF = (1 << 30) - 1;
const long long LLINF = 1LL << 61;
const long long MOD = 1000000007LL;
const int dx4[] = {1, 0, -1, 0}, dy4[] = {0, 1, 0, -1};
const int dx8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dy8[] = {0, -1, -1, -1, 0, 1, 1, 1};
const double EPS = 1e-8;

int n, s;
lint memo[105][15][1005];

lint solve(int i, int j, int k){
    if(i == 101 || j == n){
        if(j == n && k == s){
            return 1LL;
        }else{
            return 0LL;
        }
    }
    if(memo[i][j][k] >= 0LL){
        return memo[i][j][k];
    }

    return memo[i][j][k] = solve(i + 1, j, k) + solve(i + 1, j + 1, k + i);
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    while(cin >> n >> s, n){
        memset(memo, -1, sizeof(memo));
        cout << solve(0, 0, 0) << endl;
    }

    return 0;
}
