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.

[[-15, 18, 88, 39, -96], [-65, -76, 85, 2, -58], [41, -103], [-15, -196, -94, 13], [-57, 25, -169, -18, 42, -114], [-131, -61, 20, 42, -92, -50], [-93, -35], [-22, -200, -74, 17, -67, -17]]
[88, 85, 41, 13, 42, 42, -35, 17]

[[-117, -166, 78, 98, 72, -44, -59], [-181, 57, -154, -50, -195, -14], [-73, -73, -10, -118, -7, -121, 95], [99, 66], [68, -97, -20, 87, 67], [76, -170, 56, 32, -95, 41]]
[98, 57, 95, 99, 87, 76]

[[-85, -199, -139, -118, -182, -185, -83], [-170, -199, -101, -117, -14, -162, -5], [-155, -146, -122], [-33, 35, -177], [41, -174, 19, -4, -46]]

[-83, -5, -122, 35, 41]