Another FizzBuzz Task

Transform the sequence of positive integers $1, 2, 3, \ldots$ as follows:

• If an integer is divisible by 15, replace it with "FizzBuzz".
• If an integer is divisible by 3 and has not been replaced yet, replace it with "Fizz".
• If an integer is divisible by 5 and has not been replaced yet, replace it with "Buzz".
• Otherwise, leave the integer unchanged.

The beginning of the sequence is as follows:

1 2 Fizz 4 Buzz Fizz 7 8 Fizz Buzz 11 Fizz 13 14 FizzBuzz 16 17 Fizz ...

Let $F$ be the infinite string obtained by writing this sequence without spaces. Given a string $L$, determine whether $L$ appears as a substring of $F$. If it does, find the 1-based index of its first appearance.

The first line contains one integer $N$, the number of test cases ($1 \le N \le 20$). Each of the next $N$ lines contains one non-empty string $L$ made of digits and the letters "F", "B", "i", "u", and "z". The length of $L$ does not exceed 15.

For each test case, print $-1$ if $L$ does not appear in $F$. Otherwise, print the smallest 1-based index of the first element of $L$ in $F$.