Time Limit: 1000ms
Memory Limit: 65536kb
DescriptionGiven three strings, you are to determine whether the third string can be formed by combining the letters in the first two strings. The first two strings can be mixed arbitrarily, but each must stay in its original order.
For example, consider forming "tcraete" from "cat" and "tree":
String A: cat
String B: tree
String C: tcraete
As you can see, we can form the third string by alternating characters from the two strings. As a second example, consider forming "catrtee" from "cat" and "tree": String A: cat String B: tree String C: catrtee Finally, notice that it is impossible to form "cttaree" from "cat" and "tree".
InputThe first line of input file contains a single positive integer n(1 <= n <= 1000). It represents the number of data sets to follow. Each line represents a data set. For each data set, the line of input consists of three strings, separated by a single space. All strings are composed of upper and lower case 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 450, inclusive.
OutputFor each data set, if the third string can be formed from the first two, print:
Data set i: yes
or if it cannot, print:
Data set i: no
Of course i should be replaced by the data set number. See the sample output below for an example.
3 cat tree tcraete cat tree catrtee cat tree cttaree
Data set 1: yes Data set 2: yes Data set 3: no