You are given two positive integers \(d\) and \(s\). Find minimal positive integer \(n\) which is divisible by \(d\) and has sum of digits equal to \(s\).
Output
Print the required number or -1 if it doesn't exist.
Примеры
| № | Входные данные | Выходные данные |
|
1
|
13 50
|
699998
|
|
2
|
61 2
|
1000000000000000000000000000001
|
|
3
|
15 50
|
-1
|