Bipartite Graphs and Matchings · Hard problem

Men $A,B,C,D$ rank women $W,X,Y,Z$ as $A\!:\!W,X,Y,Z$; $B\!:\!W,Y,X,Z$; $C\!:\!X,W,Z,Y$; $D\!:\!W,Z,Y,X$. Women rank men as $W\!:\!D,A,B,C$; $X\!:\!A,C,D,B$; $Y\!:\!B,D,A,C$; $Z\!:\!C,D,A,B$. Running the men-proposing deferred-acceptance algorithm, find the sum of the ranks (1 = top choice) that each man assigns to the woman he ends up matched to.