You are given two positive integers n and target.

An integer is considered beautiful if the sum of its digits is less than or equal to target.

Return the minimum nonnegative integer x such that n + x is beautiful.

Constraints:

• $1 \leq$ n $\leq 10^{12}$

• $1 \leq$ target $\leq 150$

• The input will be generated such that it is always possible to make n beautiful.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.