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.

[[-100, -43, 9], [-4, -170, 48, -129, 49, 83], [41, -102, -98, 81], [27, -183, 93, 47, -13, 51], [2, -61, -170, -73, 48], [2, -118, -152, -141], [-168, -73, -166], [15, 50, 32, 4]]
[9, 83, 81, 93, 48, 2, -73, 50]

[[-31, -113, -173, -37, -4, -189, -191], [-32, 92, -46]]
[-4, 92]

[[61, -18, -49, -28, 27, -187, -126], [41, -175, -34, -78, -121, -46], [-87, -161, -62], [-95, -148], [-182, 37, 49, -39, -101, -52], [94, -2, -141, -143, -49], [-162, -133, 65], [88, -30, -78, -58, -59, -5, 95], [-139, -85, -80, -198, -55]]

[61, 41, -62, -95, 49, 94, 65, 95, -55]