There is nothing more beautiful than just an integer number.
You are given integers a, b and c. Write each of them down in decimal notation with no leading zeros. The following operations can be performed on each of the written numbers:
 Insert a single digit at any position of the number (possibly at the beginning or at the end).
 Delete a single digit from the number.
 Replace a single digit in the number with some other digit.
An operation can only be performed if it results in a positive number with at least one digit and no leading zeros.
Each operation has an associated cost  insCost, delCost and repCost, respectively. Return the minimal possible total cost of operations needed to satisfy the equality a+b=c.
