#include <bits/stdc++.h>
using namespace std;
long long n, a, k;
int main() {
  cin >> k;
  vector<vector<long long>> boxes(k);
  vector<long long> box_sums(k);
  long long s = 0;
  unordered_map<long long, long long> box;
  for (long long i = 0; i < k; ++i) {
    cin >> n;
    long long box_sum = 0;
    for (long long j = 0; j < n; ++j) {
      cin >> a;
      boxes[i].push_back(a);
      box[a] = i;
      box_sum += a;
    }
    s += box_sum;
    box_sums[i] = box_sum;
  }
  if (s % k != 0) {
    cout << "NO" << endl;
    return 0;
  }
  s /= k;
  unordered_map<long long, long long> graph;
  for (long long i = 0; i < k; ++i) {
    for (auto j : boxes[i]) {
      if (box.count(s - box_sums[i] + j)) {
        graph[j] = s - box_sums[i] + j;
      }
    }
  }
  set<long long> visited;
  unordered_map<long long, long long> cycle_mapping;
  for (auto [i, j] : box) {
    if (visited.count(i)) continue;
    long long this_cycle = 0;
    long long current = i;
    bool valid = true;
    set<long long> visited_here;
    vector<long long> seen_nodes;
    while (true) {
      seen_nodes.push_back(current);
      if (visited_here.count(current)) break;
      visited_here.insert(current);
      if (visited.count(current)) {
        valid = false;
        break;
      }
      if (graph.count(current)) {
        current = graph[current];
      } else {
        valid = false;
        break;
      }
    }
    for (auto i : visited_here) visited.insert(i);
    if (valid) {
      long long cyc = 0;
      for (long long i = seen_nodes.size() - 1; i >= 0; --i) {
        if (i != seen_nodes.size() - 1 && seen_nodes[i] == seen_nodes.back()) {
          break;
        }
        if ((cyc >> box[seen_nodes[i]]) & 1) {
          valid = false;
          break;
        } else {
          cyc ^= (1 << box[seen_nodes[i]]);
        }
      }
      if (valid) cycle_mapping[cyc] = seen_nodes.back();
    }
  }
  vector<long long> dp(1 << k, -1);
  dp[0] = 0;
  for (long long i = 0; i < dp.size(); ++i) {
    for (long long j = i; j; j = i & (j - 1)) {
      if (dp[i - j] != -1 && cycle_mapping.count(j) != 0) {
        dp[i] = j;
        break;
      }
    }
  }
  if (dp.back() == -1) {
    cout << "No" << endl;
    return 0;
  }
  vector<long long> used_cycles;
  long long fin = (1 << k) - 1;
  while (fin) {
    used_cycles.push_back(dp[fin]);
    fin -= dp[fin];
  }
  vector<tuple<long long, long long, long long>> moves;
  for (auto i : used_cycles) {
    long long init = cycle_mapping[i];
    long long cur = init;
    while (true) {
      moves.emplace_back(box[cur], cur, graph[cur]);
      cur = graph[cur];
      if (cur == init) break;
    }
  }
  sort(moves.begin(), moves.end());
  vector<long long> new_k;
  for (auto [i, j, k] : moves) new_k.push_back(box[k]);
  vector<long long> mp(k);
  for (long long i = 0; i < new_k.size(); ++i) {
    mp[new_k[i]] = i;
  }
  for (long long i = 0; i < mp.size(); ++i) get<2>(moves[i]) = mp[i];
  if (dp.back() != -1) cout << "YES" << endl;
  for (auto [i, j, k] : moves) {
    cout << j << " " << k + 1 << endl;
  }
}
