Unmatchable Stalls

Winter is coming, so Farmer John is moving his N cows (1 <= N <=
500) into the S private stalls (N <= S <= 500) in his spacious barn.
The cows, quite the bovine princesses, are willing to stay only in
certain stalls.  FJ has a list of each cow's acceptable stalls.

FJ doesn't want to commit to a particular assignment of cows to
stalls just yet. FJ will assign a cow only to a stall on her
acceptable list.  Although it might not be possible to assign all
the cows to an acceptable stall, he wants to assign the maximum
possible number of cows.

Please help FJ determine how many of each cow's acceptable stalls
will never be used in any maximum assignment.

PROBLEM NAME: unmatch

INPUT FORMAT:

* Line 1: Two space-separated integers: N and S.

* Lines 2..N+1: The ith line contains the preferences for the cow i-1
        as a list of space-separated integers.  The first integer on
        the line is the number of stalls K (1 <= K <= S) the cow
        prefers.  The remaining K fields on the line comprise the list
        of stalls (which contain no duplicates).  The sum of K over
        all these N lines will not exceed 10,000.

SAMPLE INPUT:

3 3
2 1 2
2 2 3
1 3

INPUT DETAILS:

FJ has 3 cows and 3 stalls.  Cow #1 wants to live in stalls 1 or
2, cow #2 wants stalls 2 or 3, and cow #3 only wants stall 1.

OUTPUT FORMAT:

* Lines 1..N: Each line corresponds to a cow (in the same order they
        appear in the input) and should contain a single integer
        specifying the number of the cow's acceptable stalls that will
        never be assigned to the cow in any maximum assignment.

SAMPLE OUTPUT:

1
1
0

OUTPUT DETAILS:

The only possible stall assignment is cow #1 in stall 1, cow #2 in stall 2,
and cow #3 in stall 3.

Cow #1 is unmatchable to one stall in her list: stall 2.  Cow #2 is
unmatchable to stall 3, and cow #3 has 0 unmatchable stalls.