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.

[[-43, 91, -9], [-92, -49, -69, -88, -200], [89, -39, -15, 43], [-52, 83], [39, -91, -113, 92], [-106, -91, -112, -149]]
[91, -49, 89, 83, 92, -91]

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

[[20, -70, -133, 37], [-64, -50, -95, -25, 8], [9, 2], [-71, -199], [-115, -9, -11, 67, 67, -127], [-45, -178, -185, -98, -32, 81, -149]]

[37, 8, 9, -71, 67, 81]