Vasya has got two number: $*a*$ and $*b*$. However, Vasya finds number $*a*$ too short. So he decided to repeat the operation of lengthening number $*a*$ $*n*$ times.
One operation of lengthening a number means adding exactly one digit to the number (in the decimal notation) to the right provided that the resulting number is divisible by Vasya's number $*b*$. If it is impossible to obtain the number which is divisible by $*b*$, then the lengthening operation cannot be performed.
Your task is to help Vasya and print the number he can get after applying the lengthening operation to number $*a* *n*$ times.
Input
The first line contains three integers: $*a*, *b*, *n* (1 ≤ *a*, *b*, *n* ≤ 10^{5})$.
Output
In a single line print the integer without leading zeros, which Vasya can get when he applies the lengthening operations to number $*a* *n*$ times. If no such number exists, then print number -1. If there are multiple possible answers, print any of them.
样例
5 4 5
524848
12 11 1
121
260 150 10
-1
题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。