题目描述

Bob is a sorcerer. He lives in a cuboid room which has a length of $A$, a width of $B$ and a height of $C$, so we represent it as $A \\ast B \\ast C$ . One day, he finds that his room is filled with unknown dark energy. Bob wants to neutralize all the dark energy in his room with his light magic. He can summon a $1\\ast 2 \\ast 3$ cuboid at a time to neutralize dark energy. But the cuboid must be totally in dark energy to take effect. Can you foresee whether Bob can save his room or not?

输入格式

Input has $T$ test cases.

For each line, there are three integers $A,B,C$

$1\\leq A,B,C \\leq 100$

输出格式

For each test case, if Bob can save his room, print"Yes", otherwise print"No".

样例

1 1 2 
1 1 4 
1 1 1

Yes 
Yes 
No

提示

原题 计蒜客 - A2019

By ZenFish of QLU