write a go solution for B. Bitwise Reversiontime limit per test1.5 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard output You are given three non-negative integers x, y and z. Determine whether there exist three non-negative integers a, b and c satisfying the following three conditions:  amathbin&b=x  bmathbin&c=y  amathbin&c=z where mathbin& denotes the bitwise AND operation.InputEach test contains multiple test cases. The first line contains the number of test cases t (1<=t<=10^4). The description of the test cases follows. The first and only line of each test case contains three integers x, y and z (0<=x,y,z<=10^9) — the target values of amathbin&b, bmathbin&c and amathbin&c, respectively.OutputFor each test case, output "YES" if there exists three non-negative integers a, b, and c satisfying the above conditions, and "NO" otherwise.You can output the answer in any case (upper or lower). For example, the strings "yEs", "yes", "Yes", and "YES" will be recognized as positive responses. ExampleInput51 1 13 2 64 8 129 10 1212730 3088 28130OutputYESYESNOYESNONoteIn the first test case, a=3, b=5, and c=9 satisfies the condition as 3mathbin&5=1, 5mathbin&9=1, and 3mathbin&9=1.In the second test case, a=7, b=3, and c=22 satisfies the condition as 7mathbin&3=3, 3mathbin&22=2, and 7mathbin&22=6.In the third test case, it can be proven that there are no three non-negative integers a, b, and c such that amathbin&b=4, bmathbin&c=8, and amathbin&c=12.. Output only the code with no comments, explanation, or additional text.