CF1070A.Find a Number

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

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.