#include <bits/stdc++.h>
using namespace std;
int a[16][5005];
int l[16];
long long ks[16];
long long avg;
map<long long, int> reIndex;
int mov[16][2];
int k;
vector<int> cyc[16];
int dp[(1 << 15) - 1];
pair<int, int> pre[(1 << 15) - 1];
set<int> sig;
map<int, vector<pair<long long, int>>> movOperator;
int find_cyc(int r, int i, int avg) {
  int curSig = 0;
  long long beginValue = a[r][i];
  int curRow = r;
  int beginRow = r;
  curSig |= (1 << r);
  vector<pair<long long, int>> op;
  long long needValue = avg - (ks[r] - beginValue);
  while (beginValue != needValue) {
    if (reIndex.find(needValue) == reIndex.end()) return -1;
    op.push_back(make_pair(needValue, curRow));
    curRow = reIndex[needValue];
    if (curSig & (1 << curRow)) return -1;
    curSig |= (1 << curRow);
    needValue = avg - (ks[curRow] - needValue);
  }
  op.push_back(make_pair(needValue, curRow));
  if (movOperator.find(curSig) == movOperator.end()) {
    dp[curSig] = 1;
    pre[curSig].first = curSig;
    pre[curSig].second = curSig;
    movOperator.insert(make_pair(curSig, op));
  }
  return curSig;
}
int main() {
  std::ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  cin >> k;
  int i, j;
  long long sum = 0;
  for (i = 0; i < k; i++) {
    cin >> l[i];
    ks[i] = 0;
    for (j = 0; j < l[i]; j++) {
      cin >> a[i][j];
      sum += a[i][j];
      ks[i] += a[i][j];
      reIndex[a[i][j]] = i;
    }
  }
  if (sum % k != 0) {
    cout << "No" << endl;
  } else {
    avg = sum / k;
    bool endFlag = false;
    int base = 0;
    for (i = 0; i < k && !endFlag; i++) {
      if (ks[i] != avg) {
        bool singleFlag = false;
        for (j = 0; j < l[i]; j++) {
          int ret = find_cyc(i, j, avg);
          if (ret != -1 && singleFlag == false) singleFlag = true;
        }
        if (singleFlag == false) endFlag = true;
      } else {
        base |= (1 << i);
      }
    }
    if (endFlag) {
      cout << "No" << endl;
    } else {
      dp[base] = 1;
      pre[base].first = base;
      pre[base].second = base;
      for (i = 0; i < k; i++) {
        if (base & (1 << i)) {
          movOperator[base].push_back(make_pair(a[i][0], i));
        }
      }
      for (int i = 0; i < (1 << k); i++) {
        for (int j = i; j && (dp[i] == false); j = (j - 1) & i) {
          if ((dp[j] && dp[i ^ j])) {
            dp[i] = 1;
            pre[i].first = j;
            pre[i].second = i ^ j;
          }
        }
      }
      if (dp[(1 << k) - 1]) {
        cout << "Yes" << endl;
        vector<int> ans;
        queue<int> q;
        q.push((1 << k) - 1);
        while (!q.empty()) {
          int tmp = q.front();
          q.pop();
          if (movOperator.find(tmp) != movOperator.end()) {
            ans.push_back(tmp);
          } else {
            if (pre[tmp].first != tmp) q.push(pre[tmp].first);
            if (pre[tmp].second != tmp) q.push(pre[tmp].second);
          }
        }
        vector<pair<long long, int>> ansOp;
        int i;
        for (i = 0; i < ans.size(); i++) {
          ansOp.insert(ansOp.begin(), movOperator[ans[i]].begin(),
                       movOperator[ans[i]].end());
        }
        sort(ansOp.begin(), ansOp.end(),
             [](const pair<long long, int>& l, const pair<long long, int>& r) {
               return reIndex[l.first] < reIndex[r.first];
             });
        for (i = 0; i < ansOp.size(); i++) {
          cout << ansOp[i].first << " " << ansOp[i].second + 1 << endl;
        }
      } else {
        cout << "No" << endl;
      }
    }
  }
}
