2911: Thickest Burger

内存限制:128 MB 时间限制:1.000 S
评测方式:文本比较 命题人:
提交:59 解决:35

题目描述

ACM ICPC is launching a thick burger. The thickness (or the height) of a piece of club steak is A (1 ≤ A ≤ 100). The thickness (or the height) of a piece of chicken steak is B (1 ≤ B ≤ 100).

The chef allows to add just three pieces of meat into the burger and he does not allow to add three pieces of same type of meat. As a customer and a foodie, you want to know the maximum total thickness of a burger which you can get from the chef. Here we ignore the thickness of breads, vegetables and other seasonings.

输入

The first line is the number of test cases. For each test case, a line contains two positive integers A and B.

输出

For each test case, output a line containing the maximum total thickness of a burger.

样例输入 复制

10
68 42
1 35
25 70
59 79
65 63
46 6
28 82
92 62
43 96
37 28

样例输出 复制

178
71
165
217
193
98
192
246
235
102

提示

Consider the first test case, since 68+68+42 is bigger than 68+42+42 the answer should be 68+68+42 = 178. Similarly since 1+35+35 is bigger than 1+1+35, the answer of the second test case should be 1+35+35 = 71.