21791_TheNumberofse

Given you n sets. All positive integers in sets are not less than 1 and not greater than m. If use these sets to combinate the new set, how many different new set you can get. The given sets can not be broken.

There are several cases. For each case, the first line contains two positive integer n and m ( 1 ≤ n ≤ 100, 1 ≤ m ≤ 14 ).  Then the following n lines describe the n sets. These lines each contains k+1 positive integer, the first which is k, then k integers are given. The input is end by EOF.

For each case, the output contain only one integer, the number of the different sets you get.

4 4
1 1
1 2
1 3
1 4
2 4
3 1 2 3
4 1 2 3 4

15
2