output_description: Print the number of blue balls that will be there among the first N balls in
  the row of balls.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N A B
attempt: n, m, l = map(int, input().split())
  x = n // (m + l)
  y = n % (m + l)
  if y <= m:
      print(x * m + y)
  else:
      print(x * m + y)
  
problem_description: Statement
  
  Takahashi has many red balls and blue balls. Now, he will place them in a row.
  
  Initially, there is no ball placed.
  
  Takahashi, who is very patient, will do the following operation 10^{100}
  times:
  
    * Place A blue balls at the end of the row of balls already placed. Then, place B red balls at the end of the row.
  
  How many blue balls will be there among the first N balls in the row of balls
  made this way?
samples: [{"input": "8 3 4", "output": "4\n    \n\nLet `b` denote a blue ball, and `r` denote a red ball. The first eight balls\nin the row will be `bbbrrrrb`, among which there are four blue balls.\n\n* * *"}, {"input": "8 0 4", "output": "0\n    \n\nHe placed only red balls from the beginning.\n\n* * *"}, {"input": "6 2 4", "output": "2\n    \n\nAmong `bbrrrr`, there are two blue balls."}]