Bipartite Graphs and Matchings · Superchallenge problem

Men $A,B,C,D$ rank women $W,X,Y,Z$ as $A\!:\!X,W,Z,Y$; $B\!:\!W,Z,Y,X$; $C\!:\!Z,Y,W,X$; $D\!:\!Z,Y,X,W$. Women rank men as $W\!:\!A,C,D,B$; $X\!:\!C,A,B,D$; $Y\!:\!B,D,A,C$; $Z\!:\!B,C,A,D$. Among all stable matchings for this profile, what is the LARGEST possible value of (sum of the men's ranks of their partners) MINUS (sum of the women's ranks of their partners)?