3272. Find the Count of Good Integers

You are given two positive integers n and k. An integer x is called k-palindromic if: - x is a palindrome. - x is divisible by k. An integer is called good if its digits can be rearranged to form a k-palindromic integer. For example, for k = 2, 2020 can be rearranged to form the k-palindromic integer 2002, whereas 1010 cannot be rearranged to form a k-palindromic integer. Return the count of