#include <bits/stdc++.h>
using namespace std;
const int INF = 2147483647;
const int mod = 1000000007;
int flag[1000011];
int a[111];
vector<int> ans;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int TT;
  cin >> TT;
  for (int T = 1; T <= TT; T++) {
    ans.clear();
    int n;
    cin >> n;
    for (int i = 0; i < n; i++) cin >> a[i];
    sort(a, a + n);
    int lasti = 0;
    for (int i = lasti + 1; i <= 1000000; i++) {
      if (ans.size() == n) break;
      if (flag[i] == T) continue;
      ans.push_back(i);
      lasti = i;
      for (int i1 = 0; i1 < n; i1++)
        for (int i2 = i1; i2 < n; i2++)
          if (a[i2] - a[i1] + i > 0 && a[i2] - a[i1] + i <= 1000000)
            if (flag[a[i2] - a[i1] + i] != T) flag[a[i2] - a[i1] + i] = T;
    }
    if (ans.size() != n)
      cout << "NO" << '\n';
    else {
      cout << "YES" << '\n';
      for (int i = 0; i < ans.size(); i++) cout << ans[i] << " ";
      cout << '\n';
    }
  }
  return 0;
}
