Two subsets of the set $S=p,q,r,s,t,u$ are to be chosen so that their union is $S$ and their intersection contains exactly three elements. In how many ways can this be done, assuming that the order in which the subsets are chosen does not matter?