Good memory

Time Limit: 1000 ms

Memory Limit: 65535 ms

Description

Mr Yu has a good memory.If someone gives him some people's names.He can remember them in the orginal order.Even 100 people's names,he just need two minutes.
dccmx is also a clever boy.He wants to challenge Mr Yu.Mr Yu creates a new rule.He gives dccmx some people's names in order(at most 1000 names.And name only contains lower case letters,no space).He also gives him the num of names he must remember.Mr Yu is mercy.He allows dccmx using at most m "@"s to mark the names he can't remeber.
The names order can't be changed.If dccmx gives the n names using less "@" and it is substring of Mr Yu gives,it shows dccmx is clover.
"@" is useful.It can become the name you want.

Input

The first line of the input contains an integer T (T <= 1000), indicating the number of cases. Each case begins with a single integer n( 0

Output

For every case,if the t names in the given order may be the substring of the n names using less than "@".print "dccmx is clever!" in a single line.Otherwise,print "Oh,my god!" in a single line.

Sample Input

2
8
zhao
qian
sun
li
zhou
wu
zheng
wang
5 2
zhao
qian
@
li
zhou
5
zhao
qian
sun
li
zhou
3 1
zhao
qian
@

Sample Output

dccmx is clever!
Oh,my god!

Hint

None

Source

水果杯之窦煜峰专场练习赛

提交代码