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:
[[-6, 83, -124, 9, -190, 76, -8], [48, -10, -88, -125], [5, -33, -85, 83, 31, 4, -125], [53, -95, 41], [-28, -75, -55, 35], [-103, -190]]

Ex Output:
[83, 48, 83, 53, 35, -103]


Ex Input:
[[-21, 86, -15, -87, -161], [-20, -115, -91, 23, -43], [-105, -37, -100, 78], [68, -148, -2, 20, -122], [-116, -163], [72, -155], [47, -94, -93, 55, -4, -177], [53, -120, 50, -12, -97]]

Ex Output:
[86, 23, 78, 68, -116, 72, 55, 53]


Ex Input:
[[-14, -127, -130, -76, 50], [60, -107, -111], [-169, -28], [-60, 83, 17, 95, -35, 7], [-190, -22], [97, -38, -33, 18, -186], [-48, 78, 57, 21, -193, -95, -4], [39, 9, -176, -104, -172, 99, -19]]

Ex Output:

[50, 60, -28, 95, -22, 97, 78, 99]