QOJ.ac

QOJ

Time Limit: 1 s Memory Limit: 1024 MB Total points: 100

#14371. Thickest Burger

統計

ACM ICPC is launching a thick burger. The thickness (or the height) of a piece of club steak is $A$ ($1\le A\le 100$). The thickness (or the height) of a piece of chicken steak is $B$ ($1\le B\le 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 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 seasoning.

Input

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

Output

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

Example

Input

3
68 42
1 35
25 70

Output

178
71
165

Discussions

About Discussions

The discussion section is only for posting: Editorials, General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0
No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

  1. This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
  2. Do not submit duplicated issues. Submitting multiple issues may cause your account to be banned.
  3. Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.