#include <bits/stdc++.h>
using namespace std;
long long sum[16];
vector<vector<long long> > a(16);
unordered_map<long long, int> color;
struct {
  bool fg;
  vector<int> from;
  vector<pair<int, pair<long long, int> > > ans;
} dp[1 << 16];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  memset(sum, 0, sizeof(sum));
  memset(dp, 0, sizeof(dp));
  int k;
  long long get_num, all_sum = 0;
  cin >> k;
  for (int i = 0; i < k; i++) {
    int n;
    cin >> n;
    for (int j = 0; j < n; j++) {
      cin >> get_num;
      color[get_num] = i;
      sum[i] += get_num;
      all_sum += get_num;
      a[i].push_back(get_num);
    }
  }
  if (all_sum % k != 0) {
    cout << "No" << endl;
    return 0;
  }
  all_sum /= k;
  for (int i = 0; i < k; i++) {
    for (int j = 0; j < a[i].size(); j++) {
      long long cur = a[i][j];
      bool flag = true;
      int memery = 0;
      vector<pair<int, pair<long long, int> > > li;
      do {
        int cl = 0;
        auto it = color.find(cur);
        if (it != color.end()) {
          cl = it->second;
          if (li.size() > 0) {
            li[li.size() - 1].first = cl;
          }
        } else {
          flag = false;
          break;
        }
        if (memery & (1 << cl)) {
          flag = false;
          break;
        }
        memery |= (1 << cl);
        cur = all_sum - sum[cl] + cur;
        li.push_back(make_pair(0, make_pair(cur, it->second)));
      } while (cur != a[i][j]);
      if (flag) {
        dp[memery].fg = 1;
        li[li.size() - 1].first = i;
        dp[memery].ans = li;
      }
    }
  }
  for (int i = 0; i < (1 << k); i++) {
    if (dp[i].fg) continue;
    for (int j = i; j > 0; j = (j - 1) & i) {
      if (dp[j].fg && dp[i & (~j)].fg) {
        dp[i].fg = 1;
        dp[i].from.push_back(j);
        dp[i].from.push_back(i & (~j));
        break;
      }
    }
  }
  if (dp[(1 << k) - 1].fg) {
    cout << "Yes" << endl;
    queue<int> que;
    que.push((1 << k) - 1);
    vector<pair<int, pair<long long, int> > > answer;
    while (!que.empty()) {
      int now = que.front();
      if (dp[now].from.size() == 0) {
        for (auto &x : dp[now].ans) {
          answer.push_back(x);
        }
      } else {
        que.push(dp[now].from[0]);
        que.push(dp[now].from[1]);
      }
      que.pop();
    }
    sort(answer.begin(), answer.end(),
         [](const pair<int, pair<long long, int> > &a,
            const pair<int, pair<long long, int> > &b) {
           return a.first < b.first;
         });
    for (auto &x : answer) {
      cout << x.second.first << " " << x.second.second + 1 << endl;
    }
  } else {
    cout << "No" << endl;
  }
  return 0;
}
