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:
[[-95, -68, -90, -106], [-7, -42, -177, 75, 14, -98, 19], [-10, -36], [6, 31, 55, -25, -19], [-20, -159, 89], [-70, 94, -66, -9, -34, -26, 51], [-12, 38, 23, 52, -196], [-103, 22, -32, -188, -4, -15, -108], [96, -125]]

Ex Output:
[-68, 75, -10, 55, 89, 94, 52, 22, 96]


Ex Input:
[[-88, -51, -196, 52, 31], [-40, -25, -38, -72], [-113, 74], [-1, 91, -198], [52, -61, -60], [-30, 70, -10, 98, -62, -60, -37], [-64, -40, -59, -13, -94, -57], [-194, -70, 95, 81, 7, 47]]

Ex Output:
[52, -25, 74, 91, 52, 98, -13, 95]


Ex Input:
[[-127, 43, -163, -34, -6], [11, -75, -155, -25, 7, -180, -37], [-192, 11, -104, -54], [58, -177], [-59, -138, 2, 21, -33, -194, -135], [100, -111, -180, 15, 22], [-74, -116, 25, -117]]

Ex Output:

[43, 11, 11, 58, 21, 100, 25]