Umesh and Marbles

#include "bits/stdc++.h"

#define faster ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);

#define ll long long int

#define pb push_back

#define f(a) for(ll i = 0;i<a;i++)

#define ffor(i,a,b) for(ll i = a;i<b;i++)

#define rfor(i,a,b) for(ll i = a;i>b;i--)

#define sll set<ll>

#define mll map<ll,ll>

#define vll vector<ll>

#define pll pair<ll,ll>

#define mcl map<char,ll>

#define usll unordered_set<ll,ll>

#define umll unordered_map<ll,ll>

#define umcl unordered_map<char,ll>

#define pqg priority_queue<ll>

#define pqs priority_queue<ll,vll,greater<ll> >

#define T ll t; cin>>t; while(t--)

#define freeopen freopen("input.txt","r",stdin);

#define freeclose freopen("output.txt","w",stdout);

#define MOD 1000000007

#define setbits(x) __builtin_popcountll(x)

#define INF 1000000000000000000

#define all(x) x.begin(), x.end()

using namespace std;

ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}

ll lcm(ll a, ll b) { return a * (b / gcd(a, b)); }

ll modpower(ll x,ll y,ll m){if(y==0)return 1;ll p=modpower(x,y/2,m)%m;p=(p*p)%m;return (y%2==0)?p:(x*p)%m;}


ll power(ll a,ll b)

{

    ll ans = 1;

    while(b) {

        if(b&1) ans = ans * a;

        a = a * a;

        b >>= 1;

    }

    return ans;

}

bool isPrime(ll n)

{
    if (n <= 1)

        return false;

    if (n <= 3)

        return true;



    if (n % 2 == 0 || n % 3 == 0)

        return false;

    for (ll i = 5; i * i <= n; i = i + 6)

        if (n % i == 0 || n % (i + 2) == 0)

            return false;

    return true;

}

main()

{

    faster

    T

    {

        ll n;

        cin>>n;



        ll a[n];

        ll sum=0;

        f(n){

            cin>>a[i];

            sum+=a[i];

        }
        if(sum%(n-1))

            cout<<"NO\n";

        else

        {

            ll actualsum=sum/(n-1);

            bool cheaker=true;

            f(n)

            {

                if(actualsum-a[i]>=0)

                    a[i]=actualsum-a[i];

                else

                {

                    cheaker=false;

                }
            }

            if(cheaker)

            {
                cout<<"YES\n";

                f(n)

                cout<<a[i]<<" ";

                cout<<"\n";

            }
            else
                cout<<"NO\n";

        }

    }

}