You are given an integer amount representing a sum of money. You have an infinite supply of coins of denominations 2, 5, and 10. Write a function that returns a tuple of three integers (a, b, c), where: a is the number of 10-coin pieces, b is the number of 5-coin pieces, c is the number of 2-coin pieces, such that the sum of these coins is exactly equal to amount, and the total number of coins (a + b + c) is minimized. If it is not possible to make up the amount with these coins, return (-1, -1, -1)
