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:
[[-139, -177], [-69, 92], [69, -10, -53, 2, -46, -139], [-78, -50, 16, 96, -177]]

Ex Output:
[-139, 92, 69, 96]


Ex Input:
[[32, -174, -116, -146, -74, 87, -87], [-102, -165, 7, -84, -82], [73, -170, -66], [-110, 69, -136, 39, -1, 1, -145], [-8, -27, -66, 44, 71, 96, -193], [-106, -134], [5, 26, 26, 48, -103], [-35, -137, -99, -117, 84]]

Ex Output:
[87, 7, 73, 69, 96, -106, 48, 84]


Ex Input:
[[-134, 50, 25, 39, -190, 47], [-104, -83, 100, 52, 54, 32, 77], [-87, 52, -25, 2, 27, 56], [-95, -167, 74, 80, -6, -174], [80, -135, 77, 79, -36, 67], [-174, -48, 62, 91, -195, 8], [-50, -132, 55]]

Ex Output:

[50, 100, 56, 80, 80, 91, 55]