Factorizations of and by powers of complete graphs

Let Kkd denote the Cartesian product of d copies of the complete graph Kk. We prove necessary and sufficient conditions for the existence of a Kkr-factorization of Kpns, where p is prime and k>1, n, r and s are positive integers.