A k-mirror number is a positive integer without leading zeros that is a palindrome in both base-$10$ and base-k.

Given an integer k representing the base and an integer n, return the sum of the n smallest k-mirror numbers.

Note: A palindrome is a number that reads the same both forward and backward.

Constraints:

• $2 \leq$ k $\leq 9$

• $1 \leq$ n $\leq 30$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.