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.
[[-22, -142, -132, -149, 39, -118, 50], [-135, 63], [38, -27, 43, 20], [-78, -101], [-81, -42, -109], [64, 83], [18, -180, 51, -156, -193, -198, -41], [-118, -101, -127, -148], [-141, -200, 66, -53, 1, -114, -19]]