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]

[[-190, -118, 52], [-118, -139, -176, 7, -164, -105, 8], [23, -133], [-158, 54, -118, -120], [-162, -147], [-154, -102, -134, -142, -141, -127, 61], [25, 7], [-151, -160, -44], [92, -66, -39, -131, -53, -166, 30]]
[52, 8, 23, 54, -147, 61, 25, -44, 92]

[[62, -19, -55], [66, 76, -187, -41], [4, 8, -110, 79, -53], [-113, -29, -7], [-133, -154, 68, 47, 53, -68, 33], [-80, -140, -37, -163, -78, 99]]

[62, 76, 79, -7, 68, 99]