Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
B. Stand-up Comedian

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputEve is a beginner stand-up comedian. Her first show gathered a grand total of two spectators: Alice and Bob.

Eve prepared $$$a_1 + a_2 + a_3 + a_4$$$ jokes to tell, grouped by their type:

- type 1: both Alice and Bob like them;
- type 2: Alice likes them, but Bob doesn't;
- type 3: Bob likes them, but Alice doesn't;
- type 4: neither Alice nor Bob likes them.

Initially, both spectators have their mood equal to $$$0$$$. When a spectator hears a joke he/she likes, his/her mood increases by $$$1$$$. When a spectator hears a joke he/she doesn't like, his/her mood decreases by $$$1$$$. If the mood of a spectator becomes negative (strictly below zero), he/she leaves.

When someone leaves, Eve gets sad and ends the show. If no one leaves, and Eve is out of jokes, she also ends the show.

Thus, Eve wants to arrange her jokes in such a way that the show lasts as long as possible. Help her to calculate the maximum number of jokes she can tell before the show ends.

Input

The first line contains a single integer $$$t$$$ ($$$1 \le t \le 10^4$$$) — the number of testcases.

The only line of each testcase contains four integers $$$a_1, a_2, a_3, a_4$$$ ($$$0 \le a_1, a_2, a_3, a_4 \le 10^8$$$; $$$a_1 + a_2 + a_3 + a_4 \ge 1$$$) — the number of jokes of each type Eve prepared.

Output

For each testcase, print a single integer — the maximum number of jokes Eve can tell before at least one of the spectators leaves or before she runs out of jokes.

Example

Input

45 0 0 00 0 0 52 5 10 63 0 0 7

Output

5 1 15 7

Note

In the first testcase, Eve only has jokes of the first type. Thus, there's no order to choose. She tells all her jokes, both Alice and Bob like them. Their mood becomes $$$5$$$. The show ends after Eve runs out of jokes.

In the second testcase, Eve only has jokes of the fourth type. Thus, once again no order to choose. She tells a joke, and neither Alice, nor Bob likes it. Their mood decrease by one, becoming $$$-1$$$. They both have negative mood, thus, both leave, and the show ends.

In the third testcase, first, Eve tells both jokes of the first type. Both Alice and Bob has mood $$$2$$$. Then she can tell $$$2$$$ jokes of the third type. Alice's mood becomes $$$0$$$. Bob's mood becomes $$$4$$$. Then $$$4$$$ jokes of the second type. Alice's mood becomes $$$4$$$. Bob's mood becomes $$$0$$$. Then another $$$4$$$ jokes of the third type. Alice's mood becomes $$$0$$$. Bob's mood becomes $$$4$$$. Then the remaining joke of the second type. Alice's mood becomes $$$1$$$. Bob's mood becomes $$$3$$$. Then one more joke of the third type, and a joke of the fourth type, for example. Alice's mood becomes $$$-1$$$, she leaves, and the show ends.

In the fourth testcase, Eve should first tell the jokes both spectators like, then the jokes they don't. She can tell $$$4$$$ jokes of the fourth type until the spectators leave.

Codeforces (c) Copyright 2010-2023 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Feb/08/2023 20:25:56 (i2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|