There are n families planning a trip with m cars. Let hi be the number of individuals in family i = 1,2,...,n. To minimize the possibility of any quarrels, they want to assign individuals to cars so that no two members of a family are in the same car. Formulate this problem as a network flow problem.