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.
[[-199, -50, -163, -150, 11], [-177, -158, 79, 81, -53], [-1, -21, -173, 64, -4], [95, -54], [73, -152, -158], [38, 78, -188, -14, -185], [71, -55, 76, 83, -72, -163, 77], [23, 53]]