#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<vector>
#include<string>
#include<queue>
#include<map>
using namespace std;
typedef long long ll;
int N,S;
ll dp[11][101][1001];
ll solve(int no,int num,int s){
  if(dp[no][num][s]!=-1) return dp[no][num][s];
  if(no==N){
    if(s==S) return 1;
    else return 0;
  }
  if(num>100) return 0;
  if(s>S) return 0;
  ll ret = 0;
  ret = solve(no+1,num+1,s+num) + solve(no,num+1,s);
  return dp[no][num][s] = ret;
}
int main(){
  while(1){
    memset(dp,-1,sizeof(dp));
    scanf("%d %d",&N,&S);
    if(!N && !S) break;
    printf("%lld\n",solve(0,0,0));
  }
}