Given three strings, you are to determine whether the third string can be formed by combining the characters of the first two strings. The characters of the first two strings can be mixed arbitrarily, but each must stay in its original order.
For example, consider forming “
As you can see, we can form the third string by alternating characters from the two strings.
As a second example, consider forming “
Finally, notice that it is impossible to form “
The first line of the input contains a single positive integer from 1 through 1000. It represents the number of data sets to follow. The processing for each data set is identical. The data sets appear on the following lines, one data set per line.
For each data set, the line of input consists of three strings, separated by a single space. All strings are composed of uppercase and lowercase letters only. The length of the third string is always the sum of the lengths of the first two strings. The first two strings will have lengths between 1 and 200 characters, inclusive.
For each data set, print
if the third string can be formed from the first two, or
if it cannot. Of course, n should be replaced by the data set number. See the sample output below for an example.
Output for Sample Input
|University of Debrecen; Faculty of Informatics; v. 03/01/2019|