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:
[[78, -23, -113, -137, 21, 71], [-195, 80], [-169, 20, 35, -101, 91, -78], [-174, 31, -169, -18, -159, 99, -7]]

Ex Output:
[78, 80, 91, 99]


Ex Input:
[[-64, -150, 1, 7, -71, -89, 54], [44, 34, -40], [40, -184, 50, -161, 38, -108], [-178, -136, -170, -59, -71, 12], [-80, -60, 24, -169, -1], [-145, -28, -63]]

Ex Output:
[54, 44, 50, 12, 24, -28]


Ex Input:
[[-141, -105], [-17, -135, -64, -144], [-98, -62, 66, 61], [-112, -58, -148, 89, -135], [100, -16, -53, -64]]

Ex Output:

[-105, -17, 66, 89, 100]