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.
[[-9, -198, -109], [-166, -21, 6, -84, 97, -110, -22], [-102, -96], [-99, -152, 35, 78, -195, -117], [4, 13, -29, 61], [-111, -177], [-49, -103, 73, -41, 19]]