All the students in NIT are very lazy. They want to have maximum time for rest. But due to college rules, they must maintain 75% attendance at the end of every week.

Given the schedule of a week, tell them what is the maximum amount of time they might have for resting.

NOTE:

Each day has 24 hrs. i.e. 24x60x60 seconds.

Classes can of any duration from 1 sec to 24 hrs.

Time of any 2 classes on same day will never intersect.

Constraints:

1<=t<=10

1<=n<=2000

Where n is the total number of classes in the week and t is number of test cases.

Input:

First line of input will be an integer t, the number of test cases.

Each test case will contain 7 lines i.e. the schedule of each day.

First integer in each line will denote the number of classes on that day , say ni , followed by 2xni integers denoting start and end time of each class in seconds ( where 0 represents 12:00 at night and 60 represents 12:01 at night).

Output:

For each test case output the Maximum amount of time in seconds students have for resting.