output_description: Print the number of combinations in a line.
input_description: The input is given in the following format.
  
      
      
      N V
      a1 a2 ... aN
      b1 b2 ... bN
      c1 c2 ... cN
      d1 d2 ... dN
attempt: from collections import Counter
  
  n, v = map(int, input().split())
  a, b, c, d = (tuple(map(int, input().split())) for _ in range(4))
  ab = [ai + bi for ai in a for bi in b]
  cd = [ci + di for ci in c for di in d]
  abc, cdc = Counter(ab), Counter(cd)
  
  ans = 0
  for k, t in abc.items():
      if v - k in cdc:
          ans += t * cdc[v - k]
  print(ans)
  
problem_description: Coin Combination Problem
  
  You have 4 bags A, B, C and D each of which includes N coins (there are
  totally 4N coins). Values of the coins in each bag are ai, bi, ci and di
  respectively.
  
  Find the number of combinations that result when you choose one coin from each
  bag (totally 4 coins) in such a way that the total value of the coins is V.
  You should distinguish the coins in a bag.
samples: [{"input": "3 14\n    3 1 2\n    4 8 2\n    1 2 3\n    7 3 2", "output": "9"}, {"input": "5 4\n    1 1 1 1 1\n    1 1 1 1 1\n    1 1 1 1 1\n    1 1 1 1 1", "output": "625"}]