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: def so(l, n, ar):
      if n < l:
          so(l, n + 1, ar + [True])
          so(l, n + 1, ar + [False])
      elif n == l:
          global switchOnOff
          switchOnOff.append(ar)
  
  
  switchOnOff = []
  n, m = [int(i) for i in input().split()]
  denkyus = []
  for i in range(m):
      a = [int(j) for j in input().split()]
      denkyus.append(a[1:])
  hikaku = [int(i) for i in input().split()]
  so(n, 0, [])
  
  ret = 0
  denkyuCnt = [0] * m
  for ss in switchOnOff:
      denkyuCnt = [0] * m
      for si, s in enumerate(ss):
          for ji, j in enumerate(denkyus):
              if s and (si + 1) in j:
                  denkyuCnt[ji] += 1
      subcnt = 0
      for i, d in enumerate(denkyuCnt):
          if d % 2 == hikaku[i]:
              subcnt += 1
      if subcnt == m:
          ret += 1
  print(ret)
  
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"}]