#include<deque>
#include<list>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<vector>
#include<algorithm>
#include<string>
#include<iostream>
#include<numeric>
#include<cmath>
#include<cstdio>
#include<cstring>
using namespace std;
long long a[101][8][1001];
long long f(int p,int q,int r){
  int i;
  if(q==-1)
    return p<=r&&r<=100;
  if(a[p][q][r]>=0)
    return a[p][q][r];
  long long sm=0;
  for(i=p;i<=99-q&&(q+2)*i<r;++i)
    sm+=f(i+1,q-1,r-i);
  return a[p][q][r]=sm;
}
int main(){
  memset(a,-1,sizeof(a));
  int p,q;
  while(cin>>p>>q,p||q)
    cout<<f(0,p-2,q)<<endl;
  return 0;
}