output_description: Print the number of the unnecessary cards.
  
  * * *
input_description: The input is given from Standard Input in the following format:
  
      
      
      N K
      a_1 a_2 ... a_N
attempt:     import itertools
      N,K = map(int,input().split())
      A = list(map(int,input().split()))
      A.sort()
      need = []
      iranaiko = []
      for a in A:
      	if a >= K:
      		need.append(a)
      	elif a in need:
      		need.append(a) 
      	elif a in iranaiko:
      		pass
      	else:
      		z = 0
      		B = A[:]
      		B.remove(a)
      		fusoku = [K - i - 1 for i in range(a)]
      		for bi,b in enumerate(B):
      			if b >= K:
      				break
      		B = B[:bi + 1]
      		for i in range(1,len(B) + 1):
      			C = list(itertools.combinations(B,i))
      			for c in C:
      				if sum(c) in fusoku:
      					need.append(a)
      					z = 1
      					break
      			if z == 1:
      				break
      		if z == 0:
      			iranaiko.append(a)
      print(N - len(need))
problem_description: Statement
  
  AtCoDeer the deer has N cards with positive integers written on them. The
  number on the i-th card (1≤i≤N) is a_i. Because he loves big numbers, he calls
  a subset of the cards _good_ when the sum of the numbers written on the cards
  in the subset, is K or greater.
  
  Then, for each card i, he judges whether it is _unnecessary_ or not, as
  follows:
  
    * If, for any good subset of the cards containing card i, the set that can be obtained by eliminating card i from the subset is also good, card i is unnecessary.
    * Otherwise, card i is NOT unnecessary.
  
  Find the number of the unnecessary cards. Here, he judges each card
  independently, and he does not throw away cards that turn out to be
  unnecessary.
samples: [{"input": "3 6\n    1 4 3", "output": "1\n    \n\nThere are two good sets: {2,3} and {1,2,3}.\n\nCard 1 is only contained in {1,2,3}, and this set without card 1, {2,3}, is\nalso good. Thus, card 1 is unnecessary.\n\nFor card 2, a good set {2,3} without card 2, {3}, is not good. Thus, card 2 is\nNOT unnecessary.\n\nNeither is card 3 for a similar reason, hence the answer is 1.\n\n* * *"}, {"input": "5 400\n    3 1 4 1 5", "output": "5\n    \n\nIn this case, there is no good set. Therefore, all the cards are unnecessary.\n\n* * *"}, {"input": "6 20\n    10 4 3 10 25 2", "output": "3"}]