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.

Input: Consider Input: [[-191, 34, -39, -8, 47, 13], [-94, -33, -196, -199, 28, -149, 58], [35, 97, 98, 95, -133, 99, -101], [-190, -57], [-138, -149, 1, -168, 92, -195, 3], [-77, -100], [-130, 2, 30], [0, -177], [-38, -131]]

Output: [47, 58, 99, -57, 92, -77, 30, 0, -38]


Input: Consider Input: [[59, -66, -98, -64, -117, -128, -189], [-170, -12], [-25, -110]]

Output: [59, -12, -25]


Input: Consider Input: [[18, -197, -191, 83, -6, -198], [99, -138], [-21, 8, -86, -25, -72, -96, -187], [9, 47, -153, -29, 76, -168]]


Output: [83, 99, 8, 76]