#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-9;
const int inf = 2000000000;
const long long infLL = 9000000000000000000;
template <typename first, typename second>
ostream &operator<<(ostream &os, const pair<first, second> &p) {
  return os << "(" << p.first << ", " << p.second << ")";
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
  os << "{";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ", ";
    os << *it;
  }
  return os << "}";
}
template <typename T>
ostream &operator<<(ostream &os, const set<T> &v) {
  os << "[";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ",";
    os << *it;
  }
  return os << "]";
}
template <typename T>
ostream &operator<<(ostream &os, const multiset<T> &v) {
  os << "[";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ", ";
    os << *it;
  }
  return os << "]";
}
template <typename first, typename second>
ostream &operator<<(ostream &os, const map<first, second> &v) {
  os << "[";
  for (auto it = v.begin(); it != v.end(); ++it) {
    if (it != v.begin()) os << ", ";
    os << it->first << " = " << it->second;
  }
  return os << "]";
}
void faltu() { cerr << '\n'; }
template <typename T>
void faltu(T a[], int n) {
  for (int i = 0; i < n; ++i) cerr << a[i] << ' ';
  cerr << '\n';
}
template <typename T, typename... hello>
void faltu(T arg, const hello &...rest) {
  cerr << arg << ' ';
  faltu(rest...);
}
inline bool checkBit(long long n, int i) { return n & (1LL << i); }
inline long long setBit(long long n, int i) {
  return n | (1LL << i);
  ;
}
inline long long resetBit(long long n, int i) { return n & (~(1LL << i)); }
const int mx = 2e5 + 5;
vector<int> adjlist[mx];
bool vis[mx];
int k;
vector<int> vec[16];
map<long long, long long> mp, rev_mp, which_box;
vector<int> store;
int cc;
int loop = -1;
bool yesLoop;
void dfs(int u, int root) {
  ++cc;
  if (cc > k) return;
  store.push_back(u);
  vis[u] = 1;
  for (auto v : adjlist[u]) {
    if (!vis[v])
      dfs(v, root);
    else if (v == root) {
      store.push_back(v);
      yesLoop = 1;
      vis[u] = 0;
      return;
    }
  }
  vis[u] = 0;
}
bool dp[1 << 15];
bool A[1 << 15];
vector<pair<int, pair<int, int>>> vecA[1 << 15];
void recur(int mask, vector<pair<int, pair<int, int>>> &vecB) {
  if (!vecA[mask].empty()) {
    for (auto x : vecA[mask]) vecB.push_back(x);
    return;
  }
  for (int i = mask; i > 0; i = (i - 1) & mask) {
    int new_mask1 = i, new_mask2 = i ^ mask;
    if (!(dp[new_mask1] & dp[new_mask2])) continue;
    recur(new_mask1, vecB);
    recur(new_mask2, vecB);
    return;
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  cin >> k;
  long long sum = 0;
  for (int i = 0; i < k; ++i) {
    int n;
    cin >> n;
    vec[i].resize(n);
    for (int j = 0; j < n; ++j) cin >> vec[i][j], sum += vec[i][j];
  }
  if (sum % k) {
    cout << "No" << '\n';
    return 0;
  }
  int nxt = 1;
  for (int i = 0; i < k; ++i) {
    for (auto x : vec[i]) {
      mp[x] = nxt++;
      rev_mp[nxt - 1] = x;
      which_box[x] = i;
    }
  }
  long long avg = sum / k;
  for (int i = 0; i < k; ++i) {
    long long temp_sum = 0;
    for (auto x : vec[i]) {
      temp_sum += x;
    }
    for (auto x : vec[i]) {
      long long temp = avg - temp_sum + x;
      if (abs(temp) > 1e9 + 5) continue;
      if (mp.lower_bound(temp) == mp.upper_bound(temp)) continue;
      if (which_box[temp] == i && temp != x) continue;
      adjlist[mp[x]].push_back(mp[temp]);
    }
  }
  for (int i = 1; i < nxt; ++i) {
    if (!vis[i]) {
      store.clear();
      yesLoop = 0;
      loop = -1;
      cc = 0;
      dfs(i, i);
      if (!yesLoop) continue;
      reverse(store.begin(), store.end());
      for (auto x : store) vis[x] = 1;
      vector<int> bb(k);
      for (auto x : store) ++bb[which_box[rev_mp[x]]];
      if (bb[which_box[rev_mp[store[0]]]] > 2) continue;
      bool ok = 0;
      for (int i = 1; i < (int)store.size() - 1; ++i) {
        if (bb[which_box[rev_mp[store[i]]]] > 1) {
          ok = 1;
          break;
        }
      }
      if (ok) continue;
      int mask = 0;
      vector<pair<int, pair<int, int>>> temp_store;
      for (int i = 0; i < (int)store.size() - 1; ++i) {
        int u = which_box[rev_mp[store[i]]];
        int num = rev_mp[store[i]];
        int v = which_box[rev_mp[store[i + 1]]];
        mask = setBit(mask, u);
        mask = setBit(mask, v);
        temp_store.push_back(make_pair(u, make_pair(num, v)));
      }
      if (vecA[mask].empty()) {
        vecA[mask] = temp_store;
      }
      if (mask) A[mask] = 1;
    }
  }
  for (int i = 0; i < (1 << k); ++i) dp[i] = A[i];
  for (int mask = 0; mask < (1 << k); mask++) {
    for (int i = mask; i > 0; i = (i - 1) & mask) {
      dp[mask] |= dp[i] & dp[mask ^ i];
    }
  }
  if (!dp[(1 << k) - 1]) {
    cout << "No" << '\n';
    return 0;
  }
  cout << "Yes" << '\n';
  vector<pair<int, pair<int, int>>> vecB;
  int lim = (1 << k) - 1;
  recur(lim, vecB);
  sort(vecB.begin(), vecB.end());
  for (auto x : vecB) {
    cout << x.second.first << " " << x.second.second + 1 << '\n';
  }
}
