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, 47, -92, -13], [-96, -82, -2, -121, -170, 97], [-25, 34, -96, -66, -40, 65], [-13, 35, -59, 100, -164], [-39, -131], [-7, -166, -29, 22, -3, -100, -72]]

Ex Output:
[78, 97, 65, 100, -39, 22]


Ex Input:
[[-1, 80, -4, 63], [-191, -139, 22, 31, -145], [-154, -165, 43, -190]]

Ex Output:
[80, 31, 43]


Ex Input:
[[52, -189, 70, 50, -15], [4, 69, 77, -60, 63, 10, 55], [95, -5, -111, 45, -20, -28, -115], [11, 98], [51, -47, -8, -21, -195]]

Ex Output:

[70, 77, 95, 98, 51]