{"raw_statement":[{"iden":"problem statement","content":"Takahashi is organizing a party.\nAt the party, each guest will receive one or more snack pieces.\nTakahashi predicts that the number of guests at this party will be $A$ or $B$.\nFind the minimum number of pieces that can be evenly distributed to the guests in both of the cases predicted.\nWe assume that a piece cannot be divided and distributed to multiple guests."},{"iden":"constraints","content":"*   $1 \\leq A, B \\leq 10^5$\n*   $A \\neq B$\n*   All values in input are integers."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$A$ $B$"},{"iden":"sample input 1","content":"2 3"},{"iden":"sample output 1","content":"6\n\nWhen we have six snack pieces, each guest can take three pieces if we have two guests, and each guest can take two if we have three guests."},{"iden":"sample input 2","content":"123 456"},{"iden":"sample output 2","content":"18696"},{"iden":"sample input 3","content":"100000 99999"},{"iden":"sample output 3","content":"9999900000"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}