# Restoring Numbers

A. Restoring Numbers
time limit per test
2.0 s
memory limit per test
256 MB
input
standard input
output
standard output

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.

Input

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.

Output

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.

Examples
input
Copy
6 2

output
4 2

input
Copy
7 2

output
-1

#include<iostream>
#include<algorithm>
using namespace std;
long long gcd(long long a,long long b)
{
return b?gcd(b,a%b):a;
}
int main()
{
long long s,g,k;
cin>>s>>g;
if(gcd(g,s-g)==g&&s!=g)
{
cout<<max(g,s-g)<<" "<<min(g,s-g)<<endl;
}
else cout<<"-1"<<endl;
return 0;
}