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.

[[-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]

[[-12, -101, -7, 46, 65, 60], [75, -187, -156], [21, -196], [-172, -42, -137, -90, 82, -85, 10], [4, -48, -50], [-3, -132], [-54, -23, 21]]
[65, 75, 21, 82, 4, -3, 21]

[[-173, -146, 88, -162, -174, -42, -109], [40, -114, -59, 38, -88, 43], [53, 21, -194, 60, 31, -121], [-101, 0, -91, -36], [-198, 63, -68, -177], [-134, -64, -39, -148]]

[88, 43, 60, 0, 63, -39]