Let Km,n be a complete bipartite graph with two partite sets having m and n vertices, respectively. A Kp,q factorizeation of Km,n is a set of edge-disjoint Kp,q-factors of Km,n which partition the set of edges of Km,n. When p=1 and q is a prime number, Wang, in his paper “On K1,k-factorizations of a complete bipartite graph” (Discrete Math, 1994, 126: 359-364), investigated the K1,q-factorization of Km,n and gave a sufficient condition for such a factorizeation to exist. In the paper “K1,k-factorizations of complete bipartite graphs” (Discrete Math, 2002, 259: 301-306), Du and Wang extended Wang’s result to the case that q is any positive integer. In this paper, we give a sufficient condition for Km,n to have a Kp,q-factorization. As a special case, it is shown that the Martin’s BAC conjecture is true when p:q=k:(k+1) for any positive integer k.