Freaks City

A number n can be expressed as the sum of k terms where each term's decimal digits are exclusively 1, 2, or 3. The goal is to find the smallest possible k such a decomposition exists. For T ≤ 1000 test cases and n up to 10^18. Define a function valid(x, m) that returns true if x can be decomposed into m terms satisfying the digit condition. A f ...