#include <bits/stdc++.h>
const int mod = 1e9 + 7;
long long int power(long long int a, long long int b) {
  long long int r = 1;
  for (; b; b >>= 1) {
    if (b & 1) r = r * a % mod;
    a = a * a % mod;
  }
  return r;
}
using namespace std;
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  int t;
  cin >> t;
  while (t--) {
    int n;
    cin >> n;
    int a[n];
    for (int i = 0; i < n; i++) cin >> a[i];
    int b[int(2e6 + 1)] = {0};
    vector<int> c;
    for (int i = 1; i <= 1e6; i++) {
      if (b[i])
        continue;
      else {
        c.push_back(i);
        for (int j = 0; j < n; j++)
          for (int k = j + 1; k < n; k++) {
            int h = abs(a[k] - a[j]);
            b[i + h] = 1;
          }
        if (c.size() == n) break;
      }
    }
    cout << "YES\n";
    for (auto it : c) cout << it << ' ';
    cout << '\n';
  }
  return 0;
}
