A town has m dating agencies that match men and women. Agency i has a list of men and a list of women, and may match a maximum of ci man/woman pairs from its lists. A person may be in the list of several agencies but may be matched with at most one other person. Formulate the problem of maximizing the number of matched pairs as a max-flow problem.