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.

[[-37, -136, 90, -104], [-33, -60, -12], [-7, -27, 100, -101, -172], [6, -150, -75]]
[90, -12, 100, 6]

[[-171, 49, -188, -34, -186], [-101, 34], [10, -98], [-44, 14, -6, -91, -92, 52, -111], [-79, 76, -30, -53, -129, 78, -158], [-7, -181, -163, -81, 31], [-28, -162, -154, -23, -170, 30], [18, -84]]
[49, 34, 10, 52, 78, 31, 30, 18]

[[27, -65, 74, -187, -33, -195, -2], [-45, -19, -152, -65, -114, 44], [-122, -51], [96, -62, -198, 18, 17, 56], [-109, -168, 3, -114, -95]]

[74, 44, -51, 96, 3]