In this task, you are given a list. This list contains many lists of integers. The list is several items written within a []. Your task is to find the maximum number among the members of each inner list. The output should be a list comprised of the maximums with the same order as the internal lists.
[[40, -62, -107, -121, -62], [-114, 58, 89, -120, 100, 64], [-40, 63, -69, 31, 42, 78, -100], [78, -162, -12, -97], [-161, 94, -34], [-25, -5, 15], [89, 28, -40, 19, -3, -70], [-8, -15, 30, -20, -125, -68], [-105, -77, -6, -4, -59, -33]]