{"problem":{"name":"Snack","description":{"content":"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 ","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc148_c"},"statements":[{"statement_type":"Markdown","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.\n\n## Constraints\n\n*   $1 \\leq A, B \\leq 10^5$\n*   $A \\neq B$\n*   All values in input are integers.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$A$ $B$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc148_c","tags":[],"sample_group":[["2 3","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."],["123 456","18696"],["100000 99999","9999900000"]],"created_at":"2026-03-03 11:01:14"}}