output_description: Print the answer.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N K
attempt: if __name__ == "__main__":
      s = input().split(" ")
      R = int(s[0])
      G = int(s[1])
      B = int(s[2])
      N = int(s[3])
  
      count = 0
      for i in range(N / R + 1):
          sumR = R * i
          if sumR == N:
              count += 1
              break
          elif sumR > N:
              break
          else:
              for j in range(N / G + 1):
                  sumG = G * j
                  if sumR + sumG == N:
                      count += 1
                      break
                  elif sumR + sumG > N:
                      break
                  else:
                      for k in range(N / B + 1):
                          sumB = B * k
                          if sumR + sumG + sumB == N:
                              count += 1
                              break
                          elif sumR + sumG + sumB > N:
                              break
      print(count)
  
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"}]