#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const long long INF = 0x3f3f3f3f3f3f3f3f;
const long long _INF = 0xc0c0c0c0c0c0c0c0;
const long long mod = (int)1e9 + 7;
const int N = 2e5 + 100;
const int M = N << 1;
vector<int> vc[16];
map<int, int> mp;
vector<pair<int, int> > dp[1 << 16];
int vis[N];
long long tot[N], tsum;
void solve(int now, int val, int ed, int state) {
  vis[now] = 1;
  long long ff = tot[now] - val;
  long long need = tsum - ff;
  if (mp.count(need)) {
    int to = mp[need];
    if (need == ed) {
      if (dp[state].empty()) dp[state].push_back(pair<int, int>(to, ed));
    } else if (!vis[to])
      solve(to, need, ed, state | (1 << to - 1));
  }
  vis[now] = 0;
}
pair<int, int> ans[N];
void gg(pair<int, int> p) {
  if (p == pair<int, int>(0, 0)) return;
  pair<int, int> ff = p;
  do {
    long long need = tsum - (tot[ff.first] - ff.second);
    int to = mp[need];
    ans[to] = pair<int, int>(need, ff.first);
    ff = pair<int, int>(to, need);
  } while (ff != p);
}
int main() {
  int n, m;
  scanf("%d", &n);
  long long sum = 0;
  for (int i = 1, v; i <= n; ++i) {
    scanf("%d", &m);
    while (m--) {
      scanf("%d", &v);
      vc[i].push_back(v);
      sum += v;
      tot[i] += v;
      mp[v] = i;
    }
  }
  if (sum % n != 0) {
    puts("No");
    return 0;
  }
  tsum = sum / n;
  for (int i = 1; i <= n; ++i) {
    for (int x : vc[i]) {
      solve(i, x, x, 1 << (i - 1));
    }
  }
  dp[0].push_back(pair<int, int>(0, 0));
  int K = (1 << n) - 1;
  for (int i = 1; i <= K; ++i) {
    for (int j = i; j && dp[i].empty(); j = (j - 1) & i) {
      int k = i ^ j;
      if (dp[j].empty() || dp[k].empty()) continue;
      for (pair<int, int>& t : dp[j]) dp[i].push_back(t);
      for (pair<int, int>& t : dp[k]) dp[i].push_back(t);
    }
  }
  if (dp[K].empty())
    puts("No");
  else {
    puts("Yes");
    for (pair<int, int>& t : dp[K]) gg(t);
    for (int i = 1; i <= n; ++i) printf("%d %d\n", ans[i].first, ans[i].second);
  }
  return 0;
}
