For an even integer m at least 4 and any positive integer $t$, it is shown that the complete equipartite graph $K_{km(2t)}$ can be decomposed into edge-disjoint gregarious m-cycles for any positive integer ${kappa}$ under the condition satisfying ${frac{{(m-1)}^2+3}{4m}}$ < ${kappa}$. Here it will be called a gregarious cycle if the cycle has at most one vertex from each partite set.