output_description: Print the minimum number of pieces that can be evenly distributed to the
  guests in both of the cases with A guests and B guests.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      A B
attempt: a, b = map(int, input().split())
  x = 2
  y = a
  while y % b != 0:
      y = a * x
      x += 1
  print(y)
  
problem_description: Statement
  
  Takahashi is organizing a party.
  
  At the party, each guest will receive one or more snack pieces.
  
  Takahashi predicts that the number of guests at this party will be A or B.
  
  Find the minimum number of pieces that can be evenly distributed to the guests
  in both of the cases predicted.
  
  We assume that a piece cannot be divided and distributed to multiple guests.
samples: [{"input": "2 3", "output": "6\n    \n\nWhen we have six snack pieces, each guest can take three pieces if we have two\nguests, and each guest can take two if we have three guests.\n\n* * *"}, {"input": "123 456", "output": "18696\n    \n\n* * *"}, {"input": "100000 99999", "output": "9999900000"}]