The Jealous Husbands Problem Extended

There are some Couples wanting to cross a river by a boat. The boat can carry at most 3 persons at a time and of course cannot cross the river by itself with no one on board.

The problem is that all the husbands are extremely jealous. So no woman can be in the presence of another man unless her husband is also present. Even a woman alone in a boat at a bank which has other men on that shore without her husband is not permissible.

In other words at no point of time can women outnumber men on bank or shore because that would mean some woman is husband-less!

It may be assumed that everyone knows how to row and all persons on the boat disembark and board at the same time.

Given the constraints provided, the maximum number of Couples that can be transported across the river is $n$ .

The minimum number of one-way trips needed to transport these $n$ Couples is $m$ .

Find $n\times m$ .