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:
[[-184, -93, -128, -153], [50, -104], [21, -156, -185, 27, 32, -187, -132]]

Ex Output:
[-93, 50, 32]


Ex Input:
[[-85, -197, 23, -152], [-86, 62, 72, -58, 33], [-117, 76], [-195, -177, -170, 97], [30, 79, -50, 72, 54], [-23, 49, -16, -188], [32, 5], [-109, -31]]

Ex Output:
[23, 72, 76, 97, 79, 49, 32, -31]


Ex Input:
[[76, 76, -17], [-37, -131, -136], [-46, 6, -15, 63], [-200, -133, -101, -164, -25, 55, -10], [-54, -112, -7, -97, -1, 90, -69]]

Ex Output:

[76, -37, 63, 55, 90]