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.
[[-69, -148, -141], [-1, -145], [-76, -23, 10], [-94, -126, -84], [-153, -196], [69, -152, -50, -66, 78], [-200, -176, -65, 11, -29], [22, -50, 17], [-34, 98, -183, 41, -165]]