#include<iostream>
#include<algorithm>
using namespace std;
int n,s;
long long memo[20][1010][110];
long long dp(int num,int sum,int cnt){
    if(num == n){
        if(sum == s) return 1;
        return 0;
    }
    if(memo[num][sum][cnt] != -1) return memo[num][sum][cnt];
    long long ret = 0;
    for(int i=cnt;i<=100;i++){
        if(sum+i > s) continue;
        ret += dp(num+1,sum+i,i+1);
    }
    return memo[num][sum][cnt] = ret;
}
int main(){
    
    while(cin >> n >> s,n!=0||s!=0){
        fill_n(**memo,20*1010*110,-1);
        cout << dp(0,0,0) << endl;
    }
    
    return(0);
}
