Disco (disco.X) The country cows go to the disco in the nearby town on every single evening. Since there isn't enough money for all N (1 <= N <= 100) cows to go, they decide which cows go to the disco by following rules: * Every cow has a stall with a nice picture window, initially with no stickers on it. * Every cow has a list of cow names. * After grazing in the pastures all day, a cow that was at the disco last night has to affix a sticker to the window of every cow on its list. In a surprise coincidence, every single cow went to the disco on the night before the party was announced. * A cow whose window has odd number of stickers on it goes to the disco the next night. The disco is having a huge party in M (1 <= M <= 1,000,000,000) days, but wants the cows to make reservations. How many cows will be attending the party? PROBLEM NAME: disco INPUT FORMAT: * Line 1: Two space-separated integers: N and M . * Lines 2..N+1: Each line describes one cow with a number of space-separated fields: * Field 1: An single word that is the name of a cow. The name contains 1..20 lower-case letters. * Field 2: An integer that is the number of stickers affixed to this cow's window. * Field 3: An integer K (0 <= K <= N) that is the count of names on cow's list. * Fields 4..K+4-1: The K cow names on this cow's list. SAMPLE INPUT: 3 2 bessie 2 3 bessie linda mary mary 1 1 linda linda 0 1 bessie OUTPUT FORMAT: * Line 1: A single integer that is a number of cows going to the party. SAMPLE OUTPUT: 2 OUTPUT DETAILS: First day: Only mary will be going to the disco. Second day: mary and linda will be going to the disco. Party day: bessie and mary will be going to the disco.