#include <bits/stdc++.h>
using namespace std;
const int N = 1e2 + 2;
const int mod = 1e9 + 7;
bool vis[2000001];
int a[N];
void solve() {
  int n, j;
  cin >> n;
  j = 1;
  memset(vis, false, sizeof(vis));
  vector<int> b;
  for (int i = 0; i < n; i++) cin >> a[i];
  while (b.size() != n) {
    bool ans = false;
    for (int i = 0; i < n; i++) {
      if (vis[a[i] + j]) {
        ans = true;
        break;
      }
    }
    if (!ans) {
      b.push_back(j);
      for (int i = 0; i < n; i++) {
        vis[a[i] + j] = true;
      }
    }
    j++;
  }
  cout << "YES\n";
  for (auto it : b) cout << it << " ";
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
