def dfs(n, arr, sum)
  if n == 0
    $res += 1 if sum == $s
    return
  end
  j = arr.empty? ? 0 : arr[-1] + 1
  for i in (j..100)
    break if sum+i > $s
    arr << i 
    dfs(n-1, arr, sum+i)
    arr.pop
  end
end
loop do
  $res = 0
  n, $s = gets.split.map(&:to_i)
  break if n == 0
  dfs(n, [], 0)
  p $res
end