output_description: Print the integer representing the amount of water, in milliliters, that will
  remain in Bottle 2.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      A B C
attempt: s = input()
  max_ = 0
  pre = s[0]
  ren = 1
  for i in range(1, len(s)):
      if s[i] == pre:
          ren += 1
          max_ = max(max_, ren)
      else:
          ren = 1
          pre = s[i]
  from collections import deque
  
  status = deque([[1] * len(s)])
  for i in range(max_):
      sta = [0] * len(s)
      if s[1] == "L":
          sta[0] = status[i][1]
      else:
          sta[0] = 0
      if s[-2] == "R":
          sta[-1] = status[i][-2]
      else:
          sta[-1] = 0
      a = [[1] * len(s)]
      for j in range(1, len(s) - 1):
          # print(sta)
          if s[j - 1] == "R":
              sta[j] += status[i][j - 1]
          if s[j + 1] == "L":
              sta[j] += status[i][j + 1]
      status.append(sta)
  for i in range(1 + max_ - 2):
      status.popleft()
  if (max_ - 2) % 2 == 0:
      print(" ".join([str(i) for i in status[1]]))
  else:
      print(" ".join([str(i) for i in status[0]]))
  
problem_description: Statement
  
  We have two bottles for holding water.
  
  Bottle 1 can hold up to A milliliters of water, and now it contains B
  milliliters of water.
  
  Bottle 2 contains C milliliters of water.
  
  We will transfer water from Bottle 2 to Bottle 1 as much as possible.
  
  How much amount of water will remain in Bottle 2?
samples: [{"input": "6 4 3", "output": "1\n    \n\nWe will transfer two milliliters of water from Bottle 2 to Bottle 1, and one\nmilliliter of water will remain in Bottle 2.\n\n* * *"}, {"input": "8 3 9", "output": "4\n    \n\n* * *"}, {"input": "12 3 7", "output": "0"}]