output_description: Print the answer.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N K
attempt: def combinations(R, G, B, N):
      R, G, B, N = int(R), int(G), int(B), int(N)
      sorted_tuple = sorted((R, G, B), reverse=True)
      R = sorted_tuple[0]
      G = sorted_tuple[1]
      B = sorted_tuple[2]
      number_combos = 0
      print(R)
      print(G)
      print(B)
      for x in range(N + 1):
          N_modified_x = N - R * x
          for y in range(N_modified_x + 1):
              N_modified_y = N_modified_x - G * y
              for z in range(N_modified_y + 1):
                  if B * z == N_modified_y:
                      number_combos += 1
      return number_combos
  
  
  R, G, B, N = input().split(" ")
  print(combinations(R, G, B, N))
  
problem_description: Statement
  
  Snuke has N integers: 1,2,\ldots,N. He will choose K of them and give those to
  Takahashi.
  
  How many ways are there to choose K consecutive integers?
samples: [{"input": "3 2", "output": "2\n    \n\nThere are two ways to choose two consecutive integers: (1,2) and (2,3).\n\n* * *"}, {"input": "13 3", "output": "11"}]