#include<bits/stdc++.h>
using namespace std;
int dp[10][102][20000];
int serch(int i,int j,int n)
{
    if(dp[n][i][j]>-1)return dp[n][i][j];
    else if(!n&&!j)return 1;
    else if(i==101||!n)return 0;
    return dp[n][i][j]=serch(i+1,j-i,n-1)+serch(i+1,j,n);
}
int main()
{
    int n,s;
    memset(dp,-1,sizeof(dp));
    while(cin>>n>>s&&n!=0)cout<<serch(0,s,n)<<endl;
}