Given two positive integers l and r represented as strings in base $10$, along with an integer b, return the total count of integers in the inclusive range $[l, r]$ whose base $b$ representation consists of nondecreasing digits.

A base $b$ representation has nondecreasing digits if every digit from left to right is greater than or equal to the digit before it.

Constraints:

• $1 \leq$ l.length $\leq$ r.length $\leq 100$

• $2 \leq$ b $\leq 10$

• l and r consist only of digits.

• The value represented by l is less than or equal to the value represented by r.

• l and r do not contain leading zeros.

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.