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]

[[-23, 46, -103, -74, 16], [-161, -180, 34, -156], [80, -153], [76, -198, -198, -126, 47, -59, -193], [-99, -78, -127, 68, 68, -194, -121]]
[46, 34, 80, 76, 68]

[[-90, -111, -196, -183, -65, -15, 75], [42, 49, -138, -173, -193], [-114, -64], [34, -67, 40, -78], [-142, 55, -12]]

[75, 49, -64, 40, 55]