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.

[[-199, 11, -198, 9, -12, -184, 55], [-71, 17, -44, 64], [-144, -165, 40, 56, -179], [-151, -162, -94, -31], [-58, -4, -47, -69, -6, -168, -24], [51, -144]]
[55, 64, 56, -31, -4, 51]

[[-148, 81, -175, -45, -129, 21, -51], [-167, 84, -70], [-59, -144, -3, -78, -178, -5], [-3, 93, -92, -18, -119], [-41, -77, -99], [-159, -197, -151, 21, -3], [6, -160], [87, 7, -178], [-103, -100, -16, -46]]
[81, 84, -3, 93, -41, 21, 6, 87, -16]

[[50, -4, 10, -150], [-156, 1], [69, -194, -193, 61, -83]]

[50, 1, 69]