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:
[[-37, -136, 90, -104], [-33, -60, -12], [-7, -27, 100, -101, -172], [6, -150, -75]]

Ex Output:
[90, -12, 100, 6]


Ex Input:
[[-164, 46, -40, 79, -196], [-5, 88, -93, 31, -195, 67], [-68, -147, -199, 93], [-77, -196, 74, -107, 89], [32, -122, 10, -116, -112], [-134, -113, 40, -68, -86]]

Ex Output:
[79, 88, 93, 89, 32, 40]


Ex Input:
[[-106, -135, -41, -6], [-94, -164, -154, -155, 28, 96, 56], [-42, -183, -144, -154, -172, -57]]

Ex Output:

[-6, 96, -42]