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.

Ex Input:
[[-88, 39, 100, -118, -13], [-81, -150], [38, -64, -137, -74, -27, 84]]

Ex Output:
[100, -81, 84]


Ex Input:
[[78, -23, -113, -137, 21, 71], [-195, 80], [-169, 20, 35, -101, 91, -78], [-174, 31, -169, -18, -159, 99, -7]]

Ex Output:
[78, 80, 91, 99]


Ex Input:
[[-85, 30, -110, -132, -192], [-51, -75, -41, 70, -156, -33], [-23, -9, -195, 38, -195, -68, -53], [41, -34, 9, 51, 88], [-194, -23, -182, 66], [-101, -191], [77, -103, -108, 29], [44, -165, -47, -64, 34, -95, 4], [-178, -105, -125]]

Ex Output:

[30, 70, 38, 88, 66, -101, 77, 44, -105]