output_description: Print the answer.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      R G B N
attempt: def a(R, G, B, N):
      b = 0
      for r in (1, R + 1):
          for g in (1, G + 1):
              for b in (1, B + 1):
                  if r + g + b == N:
                      b += 1
      return b
  
problem_description: Statement
  
  Snuke has come to a store that sells boxes containing balls. The store sells
  the following three kinds of boxes:
  
    * Red boxes, each containing R red balls
    * Green boxes, each containing G green balls
    * Blue boxes, each containing B blue balls
  
  Snuke wants to get a total of exactly N balls by buying r red boxes, g green
  boxes and b blue boxes. How many triples of non-negative integers (r,g,b)
  achieve this?
samples: [{"input": "1 2 3 4", "output": "4\n    \n\nFour triples achieve the objective, as follows:\n\n  * (4,0,0)\n  * (2,1,0)\n  * (1,0,1)\n  * (0,2,0)\n\n* * *"}, {"input": "13 1 4 3000", "output": "87058"}]