Consider the following decision problem OddNumberSum:

OddNumberSum Input: A set of positive odd numbers $S$. A target odd number $k$. Question: Is there an odd number of elements in $S$ whose sum is exactly $k$?

Prove that OddNumberSum is NP-complete.