// what is matter? never mind. 
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2") 
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
//#define int long long
#define ull unsigned long long
#define SZ(x) ((int)((x).size()))
#define ALL(x) (x).begin(),(x).end()
using namespace std;
inline int read()
{
    char c=getchar();int x=0;bool f=0;
    for(;!isdigit(c);c=getchar())f^=!(c^45);
    for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
    if(f)x=-x;return x;
}

#define mod 998244353
struct modint{
	int x;
	modint(int o=0){x=o;}
	modint &operator = (int o){return x=o,*this;}
	modint &operator +=(modint o){return x=x+o.x>=mod?x+o.x-mod:x+o.x,*this;}
	modint &operator -=(modint o){return x=x-o.x<0?x-o.x+mod:x-o.x,*this;}
	modint &operator *=(modint o){return x=1ll*x*o.x%mod,*this;}
	modint &operator ^=(int b){
		modint a=*this,c=1;
		for(;b;b>>=1,a*=a)if(b&1)c*=a;
		return x=c.x,*this;
	}
	modint &operator /=(modint o){return *this *=o^=mod-2;}
	friend modint operator +(modint a,modint b){return a+=b;}
	friend modint operator -(modint a,modint b){return a-=b;}
	friend modint operator *(modint a,modint b){return a*=b;}
	friend modint operator /(modint a,modint b){return a/=b;}
	friend modint operator ^(modint a,int b){return a^=b;}
	friend bool operator ==(modint a,modint b){return a.x==b.x;}
	friend bool operator !=(modint a,modint b){return a.x!=b.x;}
	bool operator ! () {return !x;}
	modint operator - () {return x?mod-x:0;}
	bool operator <(const modint&b)const{return x<b.x;}
};
inline modint qpow(modint x,int y){return x^y;}

vector<modint> fac,ifac,iv;
inline void initC(int n)
{
	if(iv.empty())fac=ifac=iv=vector<modint>(2,1);
	int m=iv.size(); ++n;
	if(m>=n)return;
	iv.resize(n),fac.resize(n),ifac.resize(n);
	For(i,m,n-1){
		iv[i]=iv[mod%i]*(mod-mod/i);
		fac[i]=fac[i-1]*i,ifac[i]=ifac[i-1]*iv[i];
	}
}
inline modint C(int n,int m){
	if(m<0||n<m)return 0;
	return initC(n),fac[n]*ifac[m]*ifac[n-m];
}
inline modint sign(int n){return (n&1)?(mod-1):(1);}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 305
#define inf 0x3f3f3f3f

bool mbe;

int n,V=800;
bool a[805][805];
modint f[805][405][805],g[2][405][805];

bool med;

signed main()
{
//	cout<<(1.0*(&mbe-&med)/1024576.0)<<"\n";
	n=read();
	For(i,1,n){
		int k=read();
		For(j,1,k)a[i][read()]=1;
	}
	f[0][0][0]=1;
	For(i,0,V)
		For(j,0,n){
			For(k,0,i) if(f[i][j][k].x) {
				if(i<V) f[i+1][j][k+(j>0)]+=f[i][j][k];
				if(j<n && a[j+1][i]) f[i][j+1][max(k-1,0)]+=f[i][j][k];
			}
		}
	modint res=0;
	g[V&1][n][0]=1;
	Rep(i,V,0){
		int nxt=i&1^1,now=i&1;
		memset(g[nxt],0,sizeof g[nxt]);
		Rep(j,n,0){
			For(k,0,V-i) if(g[now][j][k].x){
				if(i) g[nxt][j][k+(j<n)]+=g[now][j][k];
				if(j && a[j][i]) g[now][j-1][max(k-1,0)]+=g[now][j][k];
			}
		}
		if(i){
			For(j,1,n-1){
				// [j+1,n] --> [i,V]
				// [1,j]  --> [1,i-1]
				modint s1=0,s2=0;
				For(k,j,V) s1+=g[now][j][k];
				For(k,n-j,V) s2+=f[i-1][j][k];
				res+=s1*s2;
			}
		}
	}
	cout<<res.x;
	return 0;
}
/*
5
4 1 2 3 7
4 5 7 8 9
4 2 3 6 9
5 0 1 4 7 9
8 0 1 2 3 6 7 8 9

5
3 1 2 3
1 2
0
4 0 2 3 4
2 2 3
*/