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:
[[-135, 63, -164, 33], [-23, 2], [26, -11, -148, -153, 29, -2], [-191, 18, -48, -156], [53, -144, 98, 90, 52, 44, -87]]

Ex Output:
[63, 2, 29, 18, 98]


Ex Input:
[[-149, 97, 37, -156], [-179, -55, -35, -109], [-64, -190, 7, -6, -4, -96, -149]]

Ex Output:
[97, -35, 7]


Ex Input:
[[40, -40, -148, -172], [-116, -46, 92, -51, -20], [-161, -93, 46, -56], [3, -153, 79, -38, 62, -57]]

Ex Output:

[40, 92, 46, 79]