You are given an encoded string s and an integer k.

The encoded string is decoded to a tape by reading characters one by one according to the following rules:

• If the character read is a letter, that character is appended to the tape.

• If the character read is a digit $d$, the entire current tape is repeated $d$ times in total.

Return the $k^{ ext{th}}$ letter ($1$ indexed) in the decoded string.

Constraints:

• $2 \leq$ s.length $\leq 100$

• s consists of lowercase English letters and digits from $2$ through $9$.

• s starts with a letter.

• $1 \leq$ k $\leq 10^9$

• It is guaranteed that k is less than or equal to the length of the decoded string.

• The decoded string is guaranteed to have less than $2^{63}$ letters.

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.