#include <cstdio>
#include <iostream>

#define reep(i,n,m) for(int i=(n);i<(m);i++)
#define rep(i,n) reep(i,0,n)

using namespace std;

long long int dp[11][101][1001] = {0};

void solve(){
    dp[0][0][0] = 1;
    dp[1][0][0] = 1;
    reep(cou,1,11){
        reep(num,1,101){
            reep(sum,num,1001){
                reep(k,0,num){
                    dp[cou][num][sum] += dp[cou-1][k][sum-num];
                }
            }
        }
    }
}

int main(){
    solve();
    int n,s;
    while(cin >> n >> s,n+s){
        long long int ans = 0;
        rep(i,101){
            ans += dp[n][i][s];
        }
        cout << ans << endl;
    }
    return 0;
}