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]

[[-27, -28, 59, -2, -90, 50, -81], [9, 83, -62, 32]]
[59, 83]

[[-158, -146, -59, -67, 3], [-56, 45, -149, -102], [82, -80, -142, 32, -42, -35], [-160, 5, 9, -146, -166, -61], [-76, -38, -9, -81, -80, 54, -171]]

[3, 45, 82, 9, 54]