You are given three positive integers start, finish, and limit. You are also given a string s representing a positive integer.

An integer is defined as powerful if it satisfies both of the following conditions:

• Every digit of the integer is at most limit.

• The integer ends with the suffix s.

Return the number of powerful integers in the inclusive range $[$start, finish$]$.

Constraints:

• $1 \leq$ start $\leq$ finish $\leq 10^{15}$

• $1 \leq$ limit $\leq 9$

• $1 \leq$ s.length $\leq \lfloor \log_{10}($finish$) \rfloor + 1$

• s consists only of numeric digits that are at most limit.

• s does 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.