409874: GYM103821 F A + B (Harder version)

I am sure that you are all bored of the classical A + B extreme problem, That's why we came up with a harder version of this problem.

Resli sets a weekly schedule for telling jokes to his friends. A weekly plan consists of $$$7$$$ numbers where each number represents the total number of jokes that Resli is planning to tell from Saturday to Friday.

Resli will give you the number of weeks that he planned, you have to determine the total number of jokes that he is going to tell to his friends in each week.

Since this task is very hard you asked your friend Hano to help you, so he wrote a code to solve this problem using the $$$C++$$$ programming language. Here's his code:

The problem is that hano doesn't know how to submit a problem, can you submit this code for him?

Each test contains multiple test cases. The first line contains the number of test cases $$$T$$$ ($$$1 \le T \le 1000$$$). Description of the test cases follows.

Each of the following $$$T$$$ lines, contains seven integers $$$j_1, j_2, ... j_7$$$ ($$$1\le{j_1, j_2, ... j_7}\le{10}$$$) — number of jokes in each day of the week.

For each week, print in one line the total number of jokes that will be told by Resli during that week.

3
1 1 1 1 1 1 1
1 2 3 4 5 6 7
9 1 6 2 2 3 9

7
28
32