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:
[[-103, -43, 55, 15, -19], [21, -7, -107, -40, -189], [-111, 75, 73, -198, -190], [-135, 82, -144, -32, 84, -98]]

Ex Output:
[55, 21, 75, 84]


Ex Input:
[[-187, -150, -33], [-15, 40, -23, -77, -8, 49], [-40, 11, 37], [-136, -34], [25, 64, 77, 92, -190], [-43, -9, 57, -11, -185, -188, -127], [-58, 19, -27, -64], [51, -46, -19, 72], [-92, -199]]

Ex Output:
[-33, 49, 37, -34, 92, 57, 19, 72, -92]


Ex Input:
[[-28, 6, -62, -127, -89], [92, -161], [-153, 100, 78], [0, -26, -182, -47]]

Ex Output:

[6, 92, 100, 0]