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:
[[-196, 52], [80, -113], [98, -17, -86, -188, -30], [38, -90, -68], [-171, 69, 27, -179, -177], [-193, 6, -95, 81, -128, -85, -91], [-117, -25, 8], [-71, -75, 64, -111]]

Ex Output:
[52, 80, 98, 38, 69, 81, 8, 64]


Ex Input:
[[-26, 54, 36], [-50, 30, -14], [-156, -199, 52, -83, 10], [-97, -59], [-14, 5, -188, -55, 74, -190], [43, -5, 14, 28, -77, -186, -74], [-200, -151], [-162, 64]]

Ex Output:
[54, 30, 52, -59, 74, 43, -151, 64]


Ex Input:
[[-184, -95, -70, 94, -200, -16, -56], [-86, -14, 40, 14, 1], [-43, -106, -37, 44], [-132, -105], [66, -48, 71, -38, 79, -42, 11], [-97, -118], [-194, -135, -41, -39, -50, 11], [-112, -193]]

Ex Output:

[94, 40, 44, -105, 79, -97, 11, -112]