{"raw_statement":[{"iden":"statement","content":"Pavel had two positive integers a and b. He found their sum s and greatest common divisor g, and forgot a and b after that. Help him to restore the original numbers.\n\nA single line contains two integers s and g (1 ≤ s ≤ 109, 1 ≤ g ≤ 109) — sum and greatest common divisor of the numbers a and b.\n\nIf Pavel made a mistake and there are no such numbers a and b, output a single number  - 1.\n\nOtherwise, output two positive integers a and b on a single line, separated by a space. If there are multiple possible solutions, output any of them.\n\n"},{"iden":"input","content":"A single line contains two integers s and g (1 ≤ s ≤ 109, 1 ≤ g ≤ 109) — sum and greatest common divisor of the numbers a and b."},{"iden":"output","content":"If Pavel made a mistake and there are no such numbers a and b, output a single number  - 1.Otherwise, output two positive integers a and b on a single line, separated by a space. If there are multiple possible solutions, output any of them."},{"iden":"examples","content":"Input6 2Output4 2Input7 2Output-1"}],"translated_statement":null,"sample_group":[],"show_order":[],"formal_statement":"**Definitions**  \nLet $ s, g \\in \\mathbb{Z}^+ $ be given, with $ 1 \\leq s, g \\leq 10^9 $.  \n\n**Constraints**  \nFind positive integers $ a, b \\in \\mathbb{Z}^+ $ such that:  \n1. $ a + b = s $  \n2. $ \\gcd(a, b) = g $  \n\n**Objective**  \nIf such $ a, b $ exist, output any pair $ (a, b) $. Otherwise, output $ -1 $.","simple_statement":"Given two integers s and g, find two positive integers a and b such that a + b = s and gcd(a, b) = g. If no such pair exists, output -1. Otherwise, output any valid pair a and b.","has_page_source":false}