#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 998244353;
using Mint = ModInt<MO>;


/*
  d[i] := a[i] - a[i-1]  (1 <= i <= N-1)
  operation on i:
    find max l s.t. l <= i && d[l] > 0, do d[l] -= 1
    find min r s.t. i <  r && d[r] > 0, do d[r] -= 1
  
  relaxed:
    choose l <= i && d[l] > 0, do d[l] -= 1
    choose i <  r && d[r] > 0, do d[r] -= 1
  
  same?
  
  hall for relaxed
  ~~>
  cost = max{0, max{ (a[j]-a[i]) - ((N-1-i) + j) | 0 <= i <= j < N }}
       = max{0, max{ (a[j]-j) - (a[i]-i) - (N-1) | 0 <= i <= j < N }}
       = max{0, max{ (a[j]-j) - (a[i]-i) - (N-1) | 0 <= i,j < N }}  (too small if i > j)
       = max{0, max(a[i]-i) - min(a[i]-i) - (N-1)}
  
  - fix min and count (max - min >= N)
  - fix max and count (max - min >= N)
*/

namespace exper {
int N;
vector<int> D;
int brute() {
  int mn = 1001001001;
  vector<int> is(N);
  for (int i = 0; i < N; ++i) is[i] = i;
  do {
    auto ds = D;
    for (const int i : is) {
      for (int l = i    ; l > 0; --l) if (ds[l]) { --ds[l]; break; }
      for (int r = i + 1; r < N; ++r) if (ds[r]) { --ds[r]; break; }
    }
    int cost = 0;
    for (int j = 1; j < N; ++j) cost += ds[j];
    chmin(mn, cost);
  } while (next_permutation(is.begin(), is.end()));
  return mn;
}
int hall() {
  vector<int> as(N, 0);
  for (int i = 1; i < N; ++i) as[i] = as[i - 1] + D[i];
  int cost = 0;
  for (int i = 0; i < N; ++i) for (int j = 0; j < N; ++j) chmax(cost, (as[j]-j) - (as[i]-i) - (N-1));
  return cost;
}
void test() {
  const auto brt = brute();
  const auto hal = hall();
  if (brt != hal) {
    cerr << "FAIL " << N << " " << D << ": " << brt << " " << hal << endl;
    assert(false);
  }
}
void gen(int i) {
  if (i == N) {
    test();
  } else {
    for (D[i] = 0; D[i] <= N; ++D[i]) gen(i + 1);
  }
}
void run() {
  for (N = 1; ; ++N) {
    D.assign(N + 1, 0);
    gen(1);
    cerr << "PASSED N = " << N << endl;
  }
}
}  // exper
// PASSED N = 7

constexpr int INF = 1001001001;

int N;
int M[410];
int A[410][810];

Mint dp[410][810][2][2];

int main() {
  // exper::run();
  
  for (; ~scanf("%d", &N); ) {
    for (int i = 0; i < N; ++i) {
      scanf("%d", &M[i]);
      for (int j = 0; j < M[i]; ++j) {
        scanf("%d", &A[i][j]);
      }
      sort(A[i], A[i] + M[i]);
    }
    
    Mint ans = 0;
#define REP for (int u = 0; u < 2; ++u) for (int v = 0; v < 2; ++v)
    {
      int mn0 = +INF, mn1 = +INF;
      for (int i = 0; i < N-1; ++i) if (M[i]) {
        chmin(mn0, A[i][0] - i);
        chmin(mn1, A[i][M[i]-1] - i);
      }
      for (int mn = mn0; mn <= mn1; ++mn) {
        for (int i = 0; i < N; ++i) for (int j = 0; j < M[i]; ++j) REP dp[i][j][u][v] = 0;
        for (int i = 0; i < N; ++i) {
          Mint sum[2][2] = {};
          if (!i) sum[0][0] += 1;
          int jj = 0;
          for (int j = 0; j < M[i]; ++j) {
            const int b = A[i][j] - i;
            if (b >= mn) {
              if (i) {
                for (; jj < M[i - 1] && A[i - 1][jj] <= A[i][j]; ++jj) {
                  REP sum[u][v] += dp[i - 1][jj][u][v];
                }
              }
              REP dp[i][j][u || (b == mn)][v || (b >= mn + N)] += sum[u][v];
            }
          }
        }
        Mint here = 0;
        for (int j = 0; j < M[N-1]; ++j) here += dp[N-1][j][1][1];
// cerr<<"mn="<<mn<<": "<<here<<endl;
        ans -= here * mn;
      }
    }
    {
      int mx0 = -INF, mx1 = -INF;
      for (int i = 0; i < N; ++i) if (M[i]) {
        chmax(mx0, A[i][0] - i);
        chmax(mx1, A[i][M[i]-1] - i);
      }
      for (int mx = mx0; mx <= mx1; ++mx) {
        for (int i = 0; i < N; ++i) for (int j = 0; j < M[i]; ++j) REP dp[i][j][u][v] = 0;
        for (int i = 0; i < N; ++i) {
          Mint sum[2][2] = {};
          if (!i) sum[0][0] += 1;
          int jj = 0;
          for (int j = 0; j < M[i]; ++j) {
            const int b = A[i][j] - i;
            if (b <= mx) {
              if (i) {
                for (; jj < M[i - 1] && A[i - 1][jj] <= A[i][j]; ++jj) {
                  REP sum[u][v] += dp[i - 1][jj][u][v];
                }
              }
              REP dp[i][j][u || (b == mx)][v || (b <= mx - N)] += sum[u][v];
            }
          }
        }
        Mint here = 0;
        for (int j = 0; j < M[N-1]; ++j) here += dp[N-1][j][1][1];
// cerr<<"mx="<<mx<<": "<<here<<endl;
        ans += here * (mx - (N-1));
      }
    }
    
    printf("%u\n", ans.x);
  }
  return 0;
}