3272. Find the Count of Good Integers

An n-digit number (no leading zeros) is good if its digits can be rearranged into a palindrome divisible by k. Count the distinct good n-digit integers.