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:
[[76, -83, -46], [3, 41, -151, -14, -59], [73, 90, -134, 22], [1, -181, -112, -177, 32, -93], [-142, -184, 39, -5]]

Ex Output:
[76, 41, 90, 32, 39]


Ex Input:
[[25, 21, -174, -186, -91], [32, -27], [79, 21, -128, -14, -41, 14, 86], [-72, 87, 96], [-44, -33, -173], [-33, 84, -92, -109, -135, -177, -5], [-1, 93, -162, 81, 8]]

Ex Output:
[25, 32, 86, 96, -33, 84, 93]


Ex Input:
[[55, -160, -12, -98, -122], [-46, 52, -108, 2, -198, -126], [84, -82, -32, -44, -1], [14, 28, -74, -150, -157, -131, -23], [-133, 64, -84]]

Ex Output:

[55, 52, 84, 28, 64]