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:
[[-196, 52], [80, -113], [98, -17, -86, -188, -30], [38, -90, -68], [-171, 69, 27, -179, -177], [-193, 6, -95, 81, -128, -85, -91], [-117, -25, 8], [-71, -75, 64, -111]]

Ex Output:
[52, 80, 98, 38, 69, 81, 8, 64]


Ex Input:
[[-74, 5, -67, 67, 24, -3], [27, -80, -129], [-164, -114], [-190, -132, -121], [-134, -139]]

Ex Output:
[67, 27, -114, -121, -134]


Ex Input:
[[-139, -15, -32, -64, -127], [-190, -47, -71, -178, -14, 75, -134]]

Ex Output:

[-15, 75]