In this paper we develop lifted reasoning techniques for counting the number of valid configurations in combinatorics math word problems. Lifted reasoning exploits high-level symmetries and the interchangeability of objects to efficiently count the number of admissible assignments for a set of variables.