CF1422A.Fence

Yura is tasked to build a closed fence in shape of an arbitrary non-degenerate simple quadrilateral. He's already got three straight fence segments with known lengths $a$, $b$, and $c$. Now he needs to find out some possible integer length $d$ of the fourth straight fence segment so that he can build the fence using these four segments. In other words, the fence should have a quadrilateral shape with side lengths equal to $a$, $b$, $c$, and $d$. Help Yura, find any possible length of the fourth side.

A non-degenerate simple quadrilateral is such a quadrilateral that no three of its corners lie on the same line, and it does not cross itself.

尤拉需要建造一个封闭的围栏，其形状为任意非退化简单四边形。他已有三段已知长度的直栅栏，长度分别为 $a$、$b$ 和 $c$。现在他需要找出第四段直栅栏可能的整数长度 $d$，使得这四段栅栏能构成一个四边形围栏。换言之，该围栏应是一个边长分别为 $a$、$b$、$c$ 和 $d$ 的四边形。请帮助尤拉，找出任意一个满足条件的第四边长度。

非退化简单四边形是指其任意三个顶点不共线，且自身不相交的四边形。

The first line contains a single integer $t$ — the number of test cases ($1 \le t \le 1000$). The next $t$ lines describe the test cases.

Each line contains three integers $a$, $b$, and $c$ — the lengths of the three fence segments ($1 \le a, b, c \le 10^9$).

第一行包含一个整数 $t$ —— 测试用例的数量（$1 \le t \le 1000$）。接下来的 $t$ 行描述各个测试用例。

每行包含三个整数 $a$、$b$ 和 $c$ —— 三条栅栏段的长度（$1 \le a, b, c \le 10^9$）。

For each test case print a single integer $d$ — the length of the fourth fence segment that is suitable for building the fence. If there are multiple answers, print any. We can show that an answer always exists.

对于每个测试用例，输出一个整数 $d$ —— 适合建造围栏的第四段围栏的长度。如果存在多个答案，输出任意一个即可。我们可以证明答案一定存在。

We can build a quadrilateral with sides $1$, $2$, $3$, $4$.

We can build a quadrilateral with sides $12$, $34$, $56$, $42$.

我们可以用边长为 $1$、$2$、$3$、$4$ 的四条边构成一个四边形。
我们可以用边长为 $12$、$34$、$56$、$42$ 的四条边构成一个四边形。