A Partition Theorem

We prove the following: there is a primitive recursive function f_-^*(-,-), in the three variables, such that: for every natural numbers t,n>0, and c, for any natural number k>=f^*_t(n,c) the following holds. Assume L is an alphabet with n>0 letters, M is the family of non empty subsets of {1,...,k} with =