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.
[[15, -37], [-110, -197, -181, 9, 40, -111], [-75, 61, 53, 96, -39, 54, -29], [-152, -130, -130, 76, -193], [-77, 51, -142], [-177, 14, -199, -156, -150, -63, -49], [-47, 67, -156, -110, -18, 81, -143]]