CF1225A.Forgetting Things
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
Kolya is very absent-minded. Today his math teacher asked him to solve a simple problem with the equation a+1=b with positive integers a and b , but Kolya forgot the numbers a and b . He does, however, remember that the first (leftmost) digit of a was da , and the first (leftmost) digit of b was db .
Can you reconstruct any equation a+1=b that satisfies this property? It may be possible that Kolya misremembers the digits, and there is no suitable equation, in which case report so.
输入格式
The only line contains two space-separated digits da and db ( 1≤da,db≤9 ).
输出格式
If there is no equation a+1=b with positive integers a and b such that the first digit of a is da , and the first digit of b is db , print a single number −1 .
Otherwise, print any suitable a and b that both are positive and do not exceed 109 . It is guaranteed that if a solution exists, there also exists a solution with both numbers not exceeding 109 .
输入输出样例
输入#1
1 2
输出#1
199 200
输入#2
4 4
输出#2
412 413
输入#3
5 7
输出#3
-1
输入#4
6 2
输出#4
-1