You are given a list of distinct positive integer denominations and a target amount. Find the minimum total number of denominations needed to sum exactly to the target. Return an array where each element is the count of the corresponding denomination used. If it is impossible to reach the target, return an empty list.

---

...