You are given a string s, an integer t representing the number of transformations to apply, and an integer array nums of length $26$.

In a single transformation, each character c in the string is replaced simultaneously with the next nums[c - 'a'] consecutive lowercase English letters in cyclical alphabetical order (where 'a' immediately follows 'z'). For example, if nums[25] equals $2$, then 'z' is replaced by the characters 'a' and 'b'.

Return the total length of the string after performing the transformation exactly t times. Since the result may be very large, return it modulo $10^9 + 7$.

Constraints:

• $1 \leq$ s.length $\leq 10^5$

• s consists only of lowercase English letters.

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

• nums.length $= 26$

• $1 \leq$ nums[i] $\leq 25$

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.