input: Write a python function to calculate the number of paths to reach (5, 5, 5) from (x, y, z) where you can only increment one of the coordinates by 1 in each step.
  assert calculate_paths(0, 0, 0) == 126
  assert calculate_paths(3, 3, 3) == 10
  assert calculate_paths(4, 4, 4) == 1
output: def calculate_paths(x, y, z):
      from math import comb
      return comb(15 - x - y - z, 5 - x) * comb(10 - y - z, 5 - y)