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:
[[-23, 46, 40, -162, -97], [0, 78, -38, -80], [1, 79, 15, -7, -40, -88], [-117, -22], [96, -80, 62]]

Ex Output:
[46, 78, 79, -22, 96]


Ex Input:
[[-37, 85, -37, -156], [82, -161, -84, -172], [-126, -35, -39, -130, -200]]

Ex Output:
[85, 82, -35]


Ex Input:
[[63, 2, -10, 86, -171], [-10, 87, -130, -142, 56, 50, -27], [35, -145, -47, -72], [-73, -189, -113, 95], [-183, -6, 41, -88, 13, -153, -152], [-74, -15, 95, -167, 73], [-171, -38, 83, -147, -62], [-83, -51, -86, 67], [-36, 13, 7]]

Ex Output:

[86, 87, 35, 95, 41, 95, 83, 67, 13]