{"raw_statement":[{"iden":"problem statement","content":"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.\nThen, for each card $i$, he judges whether it is _unnecessary_ or not, as follows:\n\n*   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.\n*   Otherwise, card $i$ is NOT unnecessary.\n\nFind 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."},{"iden":"constraints","content":"*   All input values are integers.\n*   $1≤N≤5000$\n*   $1≤K≤5000$\n*   $1≤a_i≤10^9 (1≤i≤N)$"},{"iden":"partial score","content":"*   $300$ points will be awarded for passing the test set satisfying $N,K≤400$."},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$N$ $K$\n$a_1$ $a_2$ ... $a_N$"},{"iden":"sample input 1","content":"3 6\n1 4 3"},{"iden":"sample output 1","content":"1\n\nThere are two good sets: {$2,3$} and {$1,2,3$}.\nCard $1$ is only contained in {$1,2,3$}, and this set without card $1$, {$2,3$}, is also good. Thus, card $1$ is unnecessary.\nFor card $2$, a good set {$2,3$} without card $2$, {$3$}, is not good. Thus, card $2$ is NOT unnecessary.\nNeither is card $3$ for a similar reason, hence the answer is $1$."},{"iden":"sample input 2","content":"5 400\n3 1 4 1 5"},{"iden":"sample output 2","content":"5\n\nIn this case, there is no good set. Therefore, all the cards are unnecessary."},{"iden":"sample input 3","content":"6 20\n10 4 3 10 25 2"},{"iden":"sample output 3","content":"3"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}