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.

[[44, 44, 75, -181, 49, -30], [-102, -76, -66, 57, -83, -162], [-40, -167, 21, -29, 75, -195], [20, -158], [-125, -95], [8, -148, -4, 20, 9, -188, -157]]
[75, 57, 75, 20, -95, 20]

[[-191, 34, -39, -8, 47, 13], [-94, -33, -196, -199, 28, -149, 58], [35, 97, 98, 95, -133, 99, -101], [-190, -57], [-138, -149, 1, -168, 92, -195, 3], [-77, -100], [-130, 2, 30], [0, -177], [-38, -131]]
[47, 58, 99, -57, 92, -77, 30, 0, -38]

[[-176, 62, -134, -21, 6], [20, -73, 44, -74], [-86, -40, -153, -128, -170, -54, 73], [-59, -74, -178, 17, 4, -162], [-154, -17, -21, -49], [-49, -126, 40, -3, 87, -190, 18], [-54, 41]]

[62, 44, 73, 17, -17, 87, 41]