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.
[[-47, -166, -52, 34, -20, -48], [-147, -136, -19, -156, -116, -83], [-152, -14, -116], [-188, 10], [-117, 77, -1], [-114, 9], [38, 44, -5, 52, -174, -152, -180], [-197, 65, -84, 16, -103, 71], [5, 73, 8]]