#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const long long inf = 1e18;
int a[105], bad[2000005];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t;
  cin >> t;
  int N = 1e6 + 1;
  while (t--) {
    int n;
    cin >> n;
    for (int i = 0; i < n; i++) {
      cin >> a[i];
    }
    for (int i = 0; i < N; i++) bad[i] = 0;
    sort(a, a + n);
    vector<int> res;
    int f = 0;
    for (int add = 1; add < N; add++) {
      if (bad[add]) continue;
      res.push_back(add);
      for (int i = 0; i < n; i++) {
        for (int j = 0; j < i; j++) {
          bad[a[i] + add - a[j]]++;
        }
      }
      if (res.size() == n) {
        f = 1;
        break;
      }
    }
    if (!f)
      cout << "NO" << endl;
    else {
      cout << "YES" << endl;
      for (auto x : res) cout << x << " ";
      cout << endl;
    }
  }
}
