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.

[[45, 77, -108, -15, -54], [-159, -32, -74, 20, -167, -25, -2], [-100, -19, -143, 78], [63, -90, -69, 69, -29], [-115, -56, 77, -78, 8, -111], [-194, -63, -141, 8, 24], [-56, -125, -5], [45, -68, -6, -196, 12]]
[77, 20, 78, 69, 77, 24, -5, 45]

[[-132, 51, -121], [-123, -194, -188, 49, 47, -33, -10], [86, -119, -59, 58, 74, -75, 77], [-65, -109, 66, -108, -51], [30, 74, -151, -11, -11, -30], [-151, -181], [-117, 32, 49, -173], [-176, -152, 25, -56, -15]]
[51, 49, 86, 66, 74, -151, 49, 25]

[[-2, -145, 68, -39, 90, -120], [25, -188, -116, 3, 0, 64], [-103, -140, -194, -122]]

[90, 64, -103]