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.
[[-3, -152, -113, -130, 29], [-74, -132, -30], [-61, 86], [-196, 79, -30, 29, 50, -195], [-76, -79, -69, -34], [16, -36], [73, 23, -42, 22, -95, -2], [-29, -12, 57, -12, 21, -30, -141]]