Algorithm question

The Set Packing Problem is stated as follows: Given a set U of n elements, a collection S_1, S_2, ellipsis, S_m of subsets of U, and a number k, does there exist a collection of at least k of these subsets with the property that no two of them interest? Show that Set Packing is NP-hard