Complete tripartite graphs arbitrarily decomposable into closed trails

It is proved that any complete tripartite graph K,,,,,, where r = 5 . 2(n) and n is a nonnegative integer, has the following property: Whenever (l(1),...,l(p)) is a sequence of integers >= 3 adding up to vertical bar E(K-r,K-r,K-r)vertical bar, there is a sequence (T-1,...,T-p) of edge-disjoint closed trails in K-r,K-r,K-r such that T-i is of length l(i), i = 1,...,p.