#P1070A. Find a Number
-
ID: 4472
Type: RemoteJudge
3000ms
256MiB
Tried: 0
Accepted: 0
Difficulty: (None)
Uploaded By:
Hydro
Tags> Find a Number
No submission language available for this problem.
Description
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.
Input
The first line contains two positive integers $d$ and $s$ ($1 \le d \le 500, 1 \le s \le 5000$) separated by space.
Output
Print the required number or -1 if it doesn't exist.
Samples
13 50
699998
61 2
1000000000000000000000000000001
15 50
-1