Wang's arbitrary directed W-cycle-factor conjecture

Let $D$ be a digraph of order $n\geq 6$, and let $W\subseteq V(D)$. An arbitrary $W$-cycle-factor is a collection of disjoint directed cycles realizing a prescribed partition of $|W|$ into parts of size at least $2$.

Wang's conjecture. If $\delta(W)\geq (3n-3)/2$, then $D$ contains an arbitrary $W$-cycle-factor.

This conjecture generalizes Wang's directed arbitrary cycle-factor conjecture and the graph version for specified vertex sets. Its status is not established in the source.