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:
[[0, -183, -46, -46, -108], [-131, -150], [-93, 75, 9, 47, -33, 54, 16], [-77, -63, 29, 100, -186, -95, -84], [-115, -140, 73, -191, -117, 90], [-165, 95, 31, -180, -104, -180], [-173, -24], [13, -54, -180, -25, -46, -42], [-96, -133, 10, -61, -74]]

Ex Output:
[0, -131, 75, 100, 90, 95, -24, 13, 10]


Ex Input:
[[-51, -127, -52, 18], [-38, 41, -100, -130, -50, 79, 5], [47, -98, -37, 34, -174, -191], [72, -2, -148, -38, -61]]

Ex Output:
[18, 79, 47, 72]


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]