Mixing Words

You are given three words. Decide whether the first word and the second word can be mixed into the third word. While mixing, the letters of each word must keep their original order. That is, you repeatedly pick one of the two words and move its leftmost remaining letter to the end of the third word.

For example, mixing cat and tree can produce tcraete, and it can also produce catrtee. It cannot produce cttaree.

The first line contains the number of data sets $T$ ($1 \le T \le 1000$).

Each of the next $T$ lines holds one data set: three words separated by spaces. Every word consists of uppercase and lowercase letters only. The first word and the second word each have length between 1 and 200, and the length of the third word equals the sum of the lengths of the other two.

Print one line for each data set. If the first word and the second word of data set $n$ can be mixed into the third word, print

Data set n: yes

otherwise print

Data set n: no

Replace n with the number of the data set. Numbering starts at 1.