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.

[[-119, -83, 95], [-198, 47, 25, -195, -159, -118], [66, -138, -98, -3, 65, -142], [8, 43, -166, 75], [-181, 33, -194, -82], [-31, -9, 38, -75, 72], [9, -187, -179]]
[95, 47, 66, 75, 33, 72, 9]

[[97, -186, -18], [-4, -71, 23, -142, -52], [-49, -2, -172, -169, -114, -200], [58, 61, -30, -27, -87, -163, -9], [-146, 62, -26, 6, -98], [-5, 3, -63, 68, -158], [-162, 9, 12, -187], [-189, 15, -195]]
[97, 23, -2, 61, 62, 68, 12, 15]

[[-91, -28, -61, -188, -6], [-140, 96, 76, -36, 30, -182, 71], [-180, -54, 73, -24, 57], [-177, -74], [73, -9, 87], [57, -22, 91, 58, -184, -52, 45], [-100, -180, 51, -186, -164, -14, -168], [92, -68, -130], [10, -160, -13, 41]]

[-6, 96, 73, -74, 87, 91, 51, 92, 41]