Break and Max

You are given a strings $s$, output the *lexicographically maximum substring* after splitting the string into a new part whenever an uppercase character, comma, period, semicolon or dollar is encountered. Also lets call these characters as Delimiter characters. Solve this problem for $t$ test cases. Let's define a substring as a contiguous subsegment of a string. For example, `"acab"` is a substr