问题描述 |
---|

SHJ, ZSW, LWJ are good friends. One day, they want to play a game. There are 6 numbers on the table. Firstly, SHJ can change the order of 6 numbers. Secondly, ZSW take the first one and the last one, sum them up as his scores. Thirdly, LWJ take any of 3 numbers from the last 4 numbers, and sum them up as his scores. Finally, if ZSW's score is larger than LWJ's, ZSW wins! If ZSW's score is smaller than LWJ's, ZSW loses. If the scores are equal, there is a tie. Nowadays, it's really sad that ZSW loses his love. So SHJ wants him to win(not even tie). You have to tell SHJ whether he can achieve his goal. |

输入描述 |

There is a number T shows there are T test cases below. (1 <= T <= 2e5) For each test case, there are 6 numbers Ai. (1 <= Ai <= 1e9) |

输出描述 |

If SHJ can achieve his goal, output "ZSW is the Winner!" If he can not, output "What a sad story!" |

样例输入复制样例 |

3 1 2 3 3 2 2 2 2 2 2 2 2 1 2 2 2 3 4 |

样例输出 |

What a sad story! What a sad story! ZSW is the Winner! |

提示说明 |

If the scores are equal, then ZSW loses it, and the ending is so bad. |

相关 |

Copyright 2016 - 2024 XUJC ACM Team