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.
[[-67, -50, 39, -45], [-113, -182, -36, -66, 95, -64], [-100, -47, -200], [25, -16, 13], [65, -12, -101], [40, 3, -110, -111], [-118, -96, -117, 44, 36], [-58, -7, -116, 85, 74]]