For each test cases, k is given. k is the number of ingredients.

Following k$,$ there are k lines. Each line has $3$ numbers. They represent protein, fat and carbohydrate content in the kth ingredient.

Following these k lines, $3$ lines are given. Each line has $3$ numbers. They represent protein, fat and carbohydrate. For these $3$ targets, we need to find out the ingredients to be added to exactly match the target.

Output: for the $3$ lines in each test case, print space separated numbers denoting the ingredients to be added to get the exact match.

The ingredients must be printed in the sorted order. If there are many combinations, print the one which minimum number of ingredients.