Minimal Drops of Colors

You are given a number of test cases. For each test case, three integers ( R ), ( G ), and ( B ) are provided, representing the required drops of red, green, and blue colors respectively. The goal is to compute the minimal total number of drops needed, which is given by the equation: ( R + G + B ). For each test case, output the sum on a new line.

inputFormat

The input begins with an integer ( T ) on the first line, indicating the number of test cases. Each of the following ( T ) lines contains three space-separated integers ( R ), ( G ), and ( B ).

outputFormat

For every test case, output a single integer that represents the minimal number of drops required (i.e. the sum ( R + G + B )) on a new line.## sample

3
2 3 4
1 1 1
5 5 5

9
3
15