Complexity analysis of m!/n!(m-n)!


Given the runtime of an algorithm to be m!/(n!*(m-n)!) That is mCn, where both m and n are variables, is the complexity factorial or polynomial? Or is it something else?

Please elaborate.

Thanks