#include <iostream>
#include <complex>
#include <sstream>
#include <string>
#include <algorithm>
#include <deque>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
#include <set>
#include <limits>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <ctime>
using namespace std;
#define REP(i, j) for(int i = 0; i < (int)(j); ++i)
#define FOR(i, j, k) for(int i = (int)(j); i < (int)(k); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define REVERSE(v) reverse((v).begin(), (v).end())
typedef complex<double> P;

int N, S;

int dfs(int now, int sum, int cnt){
  if(cnt == N && sum == S) return 1;
  if(cnt == N) return 0;
  if(sum + (N - cnt) * 100 < S) return 0;
  int res = 0;
  for(int i = now; i <= 100 && sum + i <= S; ++i) res += dfs(i + 1, sum + i, cnt + 1);
  return res;
}

int main() {
  while(cin >>N >>S && N) cout <<dfs(0, 0, 0) <<endl;
  return 0;
}