In a certain code language ‘BEAMING’ is

Statement: L ≥ X ≤ Z > Y ≤ A, Y = B ≥ C 

Conclusion: I. C > A                          II. A ≥ C

Statements: P # B, Q $ B, B @ J, J % F

Statements: Z ≤ B = G; I > U; I < W < G; Z ≤ X < S

Conclusions:

I. Z < W

II. U < B

III. X > I

Statements:   R % U, U # V, V @ C, C  *  F

Conclusions :

I.  F $ V

II.  C % U

III.  R % F

Statements:   A % B & G % B; B # L & J; J @ K # S

Conclusions:

I. L @ K

II. A % K

III. S @ B

Statements: L ≤ Y = T ≤ S; S = F ≤ U; K > N = U

Conclusions:

I. K > T

II. U ≥ L

Statement:  J > K ≥ C = D ≤ Y < Z

Conclusions:

I. Z > C

II. J ≥ Y

III. J > D

IV. C > Z