Question 130
An HMMT party has $m$ MIT students and $h$ Harvard students for some positive integers $m$ and $h$. For every pair of people at the party, they are either friends or enemies. If every MIT student has 16 MIT friends and 8 Harvard friends, and every Harvard student has 7 MIT enemies and 10 Harvard enemies, compute how many pairs of friends there are at the party.