Before revision:  We show, by a non-trivial reduction from the Planar 3D-Matching problem, that this problem is NP-hard even when m= 3.
After revision:  We show, by a non-trivial reduction from the Planar 3D-Matching problem, that this problem is NP-hard even when m= 3 diagrams are given.