#include <cstdio>
#include <algorithm>
#include <cstring>

using namespace std;

typedef long long ll;

ll dp[11][1111][111];

ll solve(int a,int b,int pre)
{
  if(a<0||b<0)return 0;
  if(a==0 && b==0)return 1;
  if(dp[a][b][pre]>=0)return dp[a][b][pre];
  ll res = 0;
  for(int i = pre; i <= 100; i++) {
    res += solve(a-1,b-i,i+1);
  }
  return dp[a][b][pre] = res;
}

int main(void)
{
  int n,s;
  memset(dp,-1,sizeof(dp));
  for(;;) {
    scanf("%d%d",&n,&s); if(!n)break;
    printf("%lld\n",solve(n,s,0));
  }
  return 0;
}