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.

[[-76, -194, 15, 74], [-60, -20, 6], [-118, -40, 82], [-135, 13], [10, -24, -119, -62, -109], [0, 5]]
[74, 6, 82, 13, 10, 5]

[[9, -188, -167, -47], [-72, -97, -152, -108, -49, -5], [-88, -84, 26, -11, -91, -46, 62], [-110, -35, -61, -141, -182], [52, 29, 92, -131, -121, -98, -35], [-30, -125, -175, -123, -45], [91, -16, -57]]
[9, -5, 62, -35, 92, -30, 91]

[[-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]]

[50, 63, 43, -78, -42, 83, 51, -101, 66]