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\).
The first line contains two positive integers \(d\) and \(s\) (\(1 \le d \le 500, 1 \le s \le 5000\)) separated by space.
Print the required number or -1 if it doesn't exist.
13 50
699998
61 2
1000000000000000000000000000001
15 50
-1
3000 ms 256 Mb Правила оформления программ и список ошибок при автоматической проверке задач