#include <bits/stdc++.h>
using namespace std;
const long long MAXN = 1e5 + 5;
long long k, n[MAXN], a[20][MAXN], sum[MAXN], b[MAXN];
vector<pair<long long, long long> > v[MAXN], temp;
map<long long, long long> mp;
pair<long long, long long> ans[MAXN];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  while (cin >> k) {
    long long limit = 1 << k;
    for (long long i = 0; i <= limit; i++) v[i].clear();
    mp.clear();
    long long all = 0;
    for (long long i = 1; i <= k; i++) {
      cin >> n[i];
      sum[i] = 0;
      for (long long j = 1; j <= n[i]; j++) {
        cin >> a[i][j];
        mp[a[i][j]] = i;
        sum[i] += a[i][j];
      }
      all += sum[i];
    }
    if (all % k != 0) {
      cout << "No" << endl;
      continue;
    }
    all /= k;
    for (long long i = 1; i <= k; i++) {
      for (long long j = 1; j <= n[i]; j++) {
        long long x = all - (sum[i] - a[i][j]);
        if (mp.count(x)) {
          long long sta = 1 << (i - 1);
          temp.clear();
          temp.push_back(make_pair(mp[x], a[i][j]));
          while (x != 1e9 && x != a[i][j]) {
            long long pos = mp[x];
            if (((1 << (pos - 1)) & sta) != 0) {
              break;
            }
            sta |= 1 << (pos - 1);
            long long p = x;
            x = all - (sum[pos] - x);
            if (!mp.count(x)) {
              x = 1e9;
              break;
            } else {
              temp.push_back(make_pair(mp[x], p));
            }
          }
          if (x == a[i][j]) {
            v[sta] = temp;
          }
        }
      }
    }
    for (long long i = 1; i <= limit - 1; i++) {
      if (v[i].size()) continue;
      for (long long j = i; j; j = (j - 1) & i) {
        if (v[j].size() && v[i ^ j].size()) {
          long long len = v[j].size();
          for (long long k = 0; k <= len - 1; k++) {
            v[i].push_back(v[j][k]);
          }
          len = v[i ^ j].size();
          for (long long k = 0; k <= len - 1; k++) {
            v[i].push_back(v[i ^ j][k]);
          }
          break;
        }
      }
    }
    long long len = v[limit - 1].size();
    if (len) {
      cout << "Yes" << endl;
      for (long long i = 0; i <= len - 1; i++) {
        b[mp[v[limit - 1][i].second]] = v[limit - 1][i].second;
      }
      for (long long i = 0; i <= len - 1; i++) {
        long long p = v[limit - 1][i].first;
        ans[p].second = mp[v[limit - 1][i].second];
        ans[p].first = b[p];
      }
      for (long long i = 1; i <= k; i++) {
        cout << ans[i].first << " " << ans[i].second << endl;
      }
    } else {
      cout << "No" << endl;
    }
  }
  return 0;
}
