#include <iostream>
#include <map>
#include <tuple>
#include <cstring>
#include <vector>
#include <algorithm>

using namespace std;

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

typedef tuple<int,int,int> state;
map<state,int> dp;

int f(int i,int n,int rest){
    //trivial
    if(0){}
    else if(i>100||n<0||rest<0) return 0;
    else if(n==0&&rest==0) return 1;

    //not trivial
    else{
        int res;
        state s;
        s=state(i,n,rest);
        if(dp.count(s))
            return dp[s];
        else
            res=f(i+1,n-1,rest-i)+f(i+1,n,rest);
        dp[s]=res;
        return res;
    }
}

int main(){
    int n,s;
    while(1){
        cin>>n>>s;
        if(n==0&&s==0) break;
        cout<<f(0,n,s)<<endl;
    }
}