candies-1
Source: hackerearth
Difficulty: UNKNOWN_DIFFICULTY

On a shiny day, kindergarten kids are going to the picnic. All the kids bought some candies with them. As all of them bought different number of candies, soon quarrel started among them. Teacher decided to collect all the candies. Soon a huge heap of candies is created on the table. Teacher now decided to give equal number of candies to all, but wait. Shinchan was a curious boy, he wants know whether it is possible to do so or not? And after equal distribution how many candies does teacher will have from the remaining candies?

INPUT:
Line 1: number of test cases. T.
Line 2: in each T line you are given number of kids N.
Line 3: space separated number of candies each kid have, i.e. X.

OUTPUT
Line 1: if it is possible print “YES” , if it not possible to divide candies print “NO”.
Line 2: space separated two numbers, number of candies each kid get and candies teacher get.

CONSTRAINTS:
1 ≤ T ≤ 10;
2 ≤ N ≤ 1000;
1 ≤ X ≤ 10^10;

SAMPLE INPUT
2
4
10 12 14 8

5
2 3 5 12 2

SAMPLE OUTPUT
YES
11 0
NO
4 4

Explanation

In Case 1:
total candies = 44
each student will get 11 candies , and teacher will get 0, so ans is YES