#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
const long double PI = 3.14159265358979323846264338328;
const long long mx64 = 9223372036854775807;
const int mx32 = 2147483647;
const short int mx16 = 32767;
const long long mod1 = 1000000007;
const long long mod2 = 998244353;
struct fordp {
  int from, to;
  long long w;
};
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cout.precision(25);
  int t;
  cin >> t;
  int t2 = pow(2, t);
  map<long long, long long> g;
  vector<pair<long long, int>> ans(t, {-1, -1});
  map<long long, int> all_ints;
  vector<vector<long long>> a(t);
  vector<long long> sum(t, 0);
  long long SUM = 0;
  for (int i = 0; i < t; i++) {
    int n;
    cin >> n;
    for (int j = 0; j < n; j++) {
      long long c;
      cin >> c;
      sum[i] += c;
      all_ints[c] = i;
      a[i].push_back(c);
    }
    SUM += sum[i];
  }
  if (SUM % t) {
    cout << "No";
    return 0;
  }
  vector<bool> close(t, false);
  map<long long, int> vst;
  vector<bool> dp(t2, false);
  dp[0] = true;
  vector<vector<fordp>> dp1(t2);
  vector<pair<int, int>> ps(t2, {-1, -1});
  for (int i = 0; i < t; i++) {
    if (sum[i] == SUM / t) {
      close[i] = true;
      dp[pow(2, i)] = true;
      fordp fdp;
      fdp.from = fdp.to = i;
      fdp.w = a[i][0];
      dp1[pow(2, i)].push_back(fdp);
    } else {
      for (long long u : a[i]) {
        long long v = SUM / t - (sum[i] - u);
        if (all_ints.find(v) != all_ints.end() && !close[all_ints[v]] &&
            all_ints[v] != i) {
          g[u] = v;
          if (g.find(v) == g.end()) {
            g[v] = -mx32;
          }
          vst[u] = 0;
          vst[v] = 0;
        }
      }
    }
  }
  int step = 1;
  for (auto gg : g) {
    if (vst[gg.first]) {
      continue;
    }
    long long now = gg.first;
    vst[now] = step;
    if (now == -mx32) {
      continue;
    }
    while (true) {
      now = g[now];
      if (now == -mx32 || (vst[now] && vst[now] < step)) {
        vst[now] = step;
        break;
      }
      if (vst[now]) {
        set<int> path;
        vector<fordp> add_dp1;
        long long nnow = now;
        bool rpt = false;
        while (true) {
          fordp fdp;
          fdp.to = all_ints[now];
          fdp.from = all_ints[g[now]];
          fdp.w = g[now];
          add_dp1.push_back(fdp);
          if (path.find(all_ints[now]) != path.end()) {
            rpt = true;
          }
          path.insert(all_ints[now]);
          if (g[now] == nnow) {
            break;
          }
          now = g[now];
        }
        if (rpt) {
          break;
        }
        int tr = 0;
        for (int p : path) {
          tr += pow(2, p);
        }
        dp[tr] = true;
        dp1[tr] = add_dp1;
        break;
      }
      vst[now] = step;
    }
    step++;
  }
  for (int i = 1; i < pow(2, t); i++) {
    if (dp[i]) {
      continue;
    }
    for (int j = (i - 1) & i; j > 0; j = (j - 1) & i) {
      int k = j ^ i;
      if (dp[j] && dp[k]) {
        dp[i] = true;
        ps[i].first = j;
        ps[i].second = k;
        break;
      }
    }
  }
  if (!dp[t2 - 1]) {
    cout << "No";
    return 0;
  }
  cout << "Yes" << endl;
  queue<int> bfs;
  bfs.push(t2 - 1);
  while (bfs.size()) {
    int now = bfs.front();
    bfs.pop();
    if (ps[now].first == -1) {
      for (fordp fdp : dp1[now]) {
        ans[fdp.from] = {fdp.w, fdp.to};
      }
    } else {
      bfs.push(ps[now].first);
      bfs.push(ps[now].second);
    }
  }
  for (pair<long long, int> pr : ans) {
    cout << pr.first << " " << (pr.second + 1) << endl;
  }
  return 0;
}
