Assume that Kj×n is a complete, and multipartite graph consisting of j partite sets and n vertices in each partite set. For given graphs G1,G2,…,Gn, the multipartite Ramsey number (M-R-number) mj(G1,G2,…,Gn), is the smallest integer t, such that for any n-edge-coloring (G1,G2,…,Gn) of the edges of Kj×t, Gi contains a monochromatic copy of Gi for at least one i. The size of M-R-number mj(C3,nK2,) for j,n≥2, the size of M-R-number mj(nK2,mK2) for j≥2 and n,m≥1, and the size of M-R-number mj(C3,C3,nK2) for j≥2 and n≥1 have been computed in several papers up to now. In this paper, we determine some lower bounds for the M-R-number mj(C3,C3,nK2,mK2) for each j,n,m≥2, and some values of M-R-number mj(C3,C3,nK2,mK2) for some j≥2, and each n,m≥1.