You are given a string s consisting of lowercase English letters, an integer t representing the number of transformations to perform, and an array nums of size 26. In one transformation, every character in s is replaced according to the following rules: Return the length of the resulting string after exactly t transformations. Since the answer may be very large, return it modulo 109 + 7.