1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
#include<bits/stdc++.h>
using namespace std;
#ifdef LOCAL
template <class T, class U> auto &operator<<(ostream &out, pair<T, U> a) { return out << "(" << a.first << ", " << a.second << ")"; }
template <class T, class = class enable_if<!is_same<T, string>(), class T::iterator>::type> auto &operator<<(ostream &out, T a) {
    out << "{";
    bool fi = 1;
    for(auto b : a) {
        if(fi) {out<<b; fi=0;}
        else out<<", "<<b;
    }
    return out << "}";
}

template <class T, class X, class Y> auto &operator<<(ostream &out, const priority_queue<T,X,Y>& a) {auto b = a; vector<T> v; while(!b.empty()) {v.push_back(b.top()); b.pop();} return out<<v; }
void dump(){
   cerr << "\e[39m"<<"\n";
}
template <class T, class... Ts> void dump(T a, Ts... x) {
   cerr << a << ", ";
   dump(x...);
}
#define debug(...) cerr << "\e[91m"<<__func__<<":"<<__LINE__<<"\t"<<"[" #__VA_ARGS__ "]: ", dump(__VA_ARGS__)
#else
#define debug(...) ;
#endif

template<class C> C reversed(C c) {reverse(c.begin(),c.end()); return c;}
#define rep(i, n) for(int i=0;i<(int)(n);i++)
#define all(X) (X).begin(), (X).end()
#define mp make_pair
#define st first
#define nd second
typedef long long ll;
typedef pair<int,int> pii;

vector<vector<int> > g;
vector<int> val, visited, fvisited;
int n, ep;


bool dfs(int cur, int tim, int b) {
    if(cur > tim)
        return 1;
    assert(cur != b);
    visited[cur] = ep;
    for(auto a:g[cur]) {
        if(a == b) continue;
        if(visited[a] != ep) {
            if(a > tim)
                return 1;
            if(dfs(a,tim,b)) {
                return 1;
            }
        }
        else if(fvisited[a] != ep) {
            return 1;
        }
    }
    fvisited[cur] = ep;
    return 0;
}

int getTimeWhenNeeded(int cur, int b) {
    ep++;
    int notneeded = dfs(cur,n,b);
    if(notneeded) return n;

    int low=b, high = n, mid,lg=n;
    while(low <= high) {
        mid = (low+high)/2;
        ep++;
        if(dfs(cur, mid, b)) {
            low = mid+1;
        }
        else {
            high = mid-1;
            lg = mid;
        }
    }
    return lg;
}

int32_t main(){
    ios::sync_with_stdio(false); cin.tie(0);
    cin >> n;
    g.resize(n);
    val.resize(n);
    visited.resize(n);
    fvisited.resize(n);
    for(int i=0;i<n;i++) {
        int l;
        cin >> l;
        g[i].resize(l);
        for(int j=0;j<l;j++) {
            cin >> g[i][j];
            g[i][j]--;
        }
    }

    vector<int> res(n+1);
    for(int i=0;i<n;i++) {
        for(int j=0;j<n;j++) {
            if(i == j) continue;
            res[getTimeWhenNeeded(i,j)]++;
        }
    }
    cout<<0;
    for(int i=1;i<n;i++) {
        res[i] += res[i-1];
        cout<<" "<<res[i];
    }
}