output_description: Print the number of combinations of "on" and "off" states of the switches that
  light all the bulbs.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N M
      k_1 s_{11} s_{12} ... s_{1k_1}
      :
      k_M s_{M1} s_{M2} ... s_{Mk_M}
      p_1 p_2 ... p_M
attempt: count = input().split()
  switch = int(count[0])
  bulb = int(count[1])
  
  condition = []
  
  for i in range(bulb):
      condition.append(input().split()[1:])
  
  # 全ての可能なスイッチの組み合わせ
  candidate = []
  for j in range(2**switch):
      num = str(bin(j))[2:]
      if len(num) < (switch):
          num = "0" * (switch - len(num)) + num
      candidate.append(num)
  
  wanted = input().split()
  
  bad_count = 0
  
  # 条件に合わないものから消していく
  for i in range(len(candidate)):
      judge = 0
      for j in range(len(condition)):
          tasumono = [int(k) - 1 for k in condition[j]]
          sum_switch = 0
          for l in tasumono:
              sum_switch += int(candidate[i][l])
          if sum_switch % 2 != int(wanted[j]):
              judge += 1
      if judge != 0:
          bad_count += 1
  
  print(2**switch - bad_count)
  
problem_description: Statement
  
  We have N switches with "on" and "off" state, and M bulbs. The switches are
  numbered 1 to N, and the bulbs are numbered 1 to M.
  
  Bulb i is connected to k_i switches: Switch s_{i1}, s_{i2}, ..., and s_{ik_i}.
  It is lighted when the number of switches that are "on" among these switches
  is congruent to p_i modulo 2.
  
  How many combinations of "on" and "off" states of the switches light all the
  bulbs?
samples: [{"input": "2 2\n    2 1 2\n    1 2\n    0 1", "output": "1\n    \n\n  * Bulb 1 is lighted when there is an even number of switches that are \"on\" among the following: Switch 1 and 2.\n  * Bulb 2 is lighted when there is an odd number of switches that are \"on\" among the following: Switch 2.\n\nThere are four possible combinations of states of (Switch 1, Switch 2): (on,\non), (on, off), (off, on) and (off, off). Among them, only (on, on) lights all\nthe bulbs, so we should print 1.\n\n* * *"}, {"input": "2 3\n    2 1 2\n    1 1\n    1 2\n    0 0 1", "output": "0\n    \n\n  * Bulb 1 is lighted when there is an even number of switches that are \"on\" among the following: Switch 1 and 2.\n  * Bulb 2 is lighted when there is an even number of switches that are \"on\" among the following: Switch 1.\n  * Bulb 3 is lighted when there is an odd number of switches that are \"on\" among the following: Switch 2.\n\nSwitch 1 has to be \"off\" to light Bulb 2 and Switch 2 has to be \"on\" to light\nBulb 3, but then Bulb 1 will not be lighted. Thus, there are no combinations\nof states of the switches that light all the bulbs, so we should print 0.\n\n* * *"}, {"input": "5 2\n    3 1 2 5\n    2 2 3\n    1 0", "output": "8"}]