Cyclically decomposing the complete graph into cycles

Let m1,m2,…,mk be positive integers not less than 3 and let n=∑i=1k mi. Then, it is proved that the complete graph of order 2n+1 can be cyclically decomposed into k(2n+1) cycles such that, for each i=1,2,…,k, the cycle of length mi occurs exactly 2n+1 times.