An n-partite tournament is an orientation of a complete n-partite graph. If D is a strongly connected n-partite (ngreater than or equal to3) tournament, then we shall prove that every partite set of D has at least one vertex which lies on a cycle C-m of each length m for m is an element of {3,4,...n} such that V(C-3)subset ofV(C-4)subset of...subset ofV(C-n), where V(C-m) is the vertex set of C-m for . This result extends those of Bondy [2], Guo and Volkmann [4], Gutin [6], Moon [8], and Yeo [12].