#include <bits/stdc++.h>
using namespace std;
template <class T>
bool umin(T &a, T b) {
  return a > b ? (a = b, true) : false;
}
template <class T>
bool umax(T &a, T b) {
  return a < b ? (a = b, true) : false;
}
long long POW(long long a, long long p, long long M) {
  if (!p) return 1LL;
  long long T = POW(a, p / 2, M);
  T = T * T % M;
  if (p & 1) T = T * (a % M) % M;
  return T;
}
long long SQRT(long long a) {
  long long b = (long long)sqrtl(((double)a) + 0.5);
  while (b * b < a) ++b;
  while (b * b > a) --b;
  return (b * b == a) ? b : -1;
}
const long long MOD = 1e9 + 7;
const long long N = 1 << 15;
long long vs[N + 1];
long long dp[N + 1];
map<long long, long long> m;
long long tt[16];
vector<vector<long long>> v(16);
long long k;
long long usd[16];
long long req;
long long SL(long long msk) {
  if (!msk) return 1;
  if (vs[msk] != -1) return vs[msk];
  vector<long long> lv;
  for (long long i = 0; i < k; i++)
    if ((1 << i) & msk) lv.push_back(i);
  long long st = lv[0];
  long long ps = -1;
  vs[msk] = 0;
  for (auto it : v[st]) {
    memset(usd, 0, sizeof(usd));
    for (auto is : lv) usd[is] = 1;
    long long cp = msk;
    long long x, mx;
    x = st;
    mx = it;
    long long mist = 0;
    while (1) {
      cp -= 1 << x;
      if (!usd[x]) mist = 1;
      usd[x]--;
      long long rq = req - (tt[x] - mx);
      if (!m.count(rq)) mist = 1;
      long long f = m[rq];
      if (f == st && rq == it) break;
      if (mist) break;
      x = f;
      mx = rq;
    }
    if (mist) continue;
    if (SL(cp)) {
      ps = it;
      break;
    }
  }
  if (ps != -1) {
    vs[msk] = 1;
    dp[msk] = ps;
  }
  return vs[msk];
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.precision(10);
  cout << fixed;
  cin >> k;
  v.resize(k);
  for (long long i = 0; i < k; i++) {
    long long n;
    cin >> n;
    tt[i] = 0;
    while (n--) {
      long long a;
      cin >> a;
      v[i].push_back(a);
      m[a] = i;
      req += a;
      tt[i] += a;
    }
  }
  if (req % k) {
    cout << "No\n";
    return 0;
  }
  req /= k;
  memset(vs, -1, sizeof(vs));
  long long f = SL((1 << k) - 1);
  if (f) {
    cout << "Yes\n";
    long long msk = (1 << k) - 1;
    vector<pair<long long, pair<long long, long long>>> ff;
    while (msk) {
      vector<long long> lv;
      for (long long i = 0; i < k; i++)
        if ((1 << i) & msk) lv.push_back(i);
      long long x = lv[0];
      long long mx = dp[msk];
      while (1) {
        msk -= 1 << x;
        long long rq = req - (tt[x] - mx);
        long long f = m[rq];
        ff.push_back({f, {rq, x + 1}});
        if (f == lv[0]) break;
        x = f;
        mx = rq;
      }
    }
    sort((ff).begin(), (ff).end());
    for (auto it : ff)
      cout << it.second.first << " " << it.second.second << endl;
  } else
    cout << "No\n";
  cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s\n";
  return 0;
}
