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]

[[-73, 37, -21, -114, -70, -143, -15], [-28, -38, 32, -102], [-192, -47, 34, -51, -69, 1, -118], [-161, -3, -23], [-176, -187, 97, -134], [97, -175], [61, -159, -108, -179, 68]]
[37, 32, 34, -3, 97, 97, 68]

[[-112, -117, 28, -74, 34, -55, 79], [83, -31, -81], [-107, 51, -122, -10], [-143, 82, -170, 38], [86, -117], [-5, -139]]

[79, 83, 51, 82, 86, -5]