The task is to generate the correct answer for a given math problem.

Example Input: Problem: the sum of all the digits of the integers from 18 to 21 inclusive is 24 ( 1 + 8 + 1 + 9 + 2 + 0 + 2 + 1 = 24 ) . what is the sum t of all the digits of the integers from 0 to 99 inclusive ?
Example Output: 900

Example Input: Problem: there are 7 executives , including the ceo and cfo , that are asked to form a small team of 4 members . however , the ceo and cfo may not both be assigned to the team . given this constraint , how many ways are there to form the team ?
Example Output: 25

Example Input: Problem: if n is a positive integer and n ^ 2 is divisible by 36 , then the largest positive integer that must divide n is
Example Output:
6