Problem Statement:

Fegla wants to give his trainees some problems to solve, he has N different problemsets and N trainees, and each problemset contains zero or more problems. He will give each trainee exactly one problemset. But the probelmsets might contain different number of problems in each one, which looks unfair.

Since Fegla is a fair coach, he decided to move some problems from problemset to another problemset (he can do this multiple times), until all problemsets contain the same number of problems.

Sometimes it's impossible to do so, and he might need to delete some problems completely before moving any problem, then he will start moving the problems. Your task is to write a program to calculate the minimum number of problems to be deleted, and the minimum number of problems to be moved.

Input Format:

Your program will be tested on one or more test cases. The first line of the input will be a single integer T, the number of test cases (1 <= T <= 100). Followed by the test cases, each test case starts with a line containing one integer N (1 <= N <= 100) representing the number of problemsets and the number of trainees, followed by a line which contains N non-negative integers separated by a single space, representing the number of problems in each problemset. Each problemset will contain at most 100 problems.

Output Format:

For each test case, print a single line which will contain the minimum number of problems to be deleted, followed by a space then the minimum number of problems to be moved.

Sample Input:

3
3
3 3 3
3
1 2 3
4
6 4 5 3

Sample Output:

0 0
0 1
2 1