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:
[[-21, -17, -178, 61, -92, -68], [-171, 1, -185, 17, -19, 4, -95]]

Ex Output:
[61, 17]


Ex Input:
[[-184, -9, -39, 19, -2], [-122, -141, -96, -147], [-100, -186, 60, 52], [43, 38, -18, -20, -150, -40, 50], [63, -70, -158], [58, 38, 42, -13, -61, 30, -129], [1, 92, -75, 2, -7, -88], [-63, -192, -194, 44, 67, 20, -100]]

Ex Output:
[19, -96, 60, 50, 63, 58, 92, 67]


Ex Input:
[[-160, 62], [-190, 46, -142, 85, -101, 68, -122], [-77, -165, -64, 35, -50, -83, -84], [82, -64], [-116, -173, -14, -191], [-168, -82, 14, -16], [-78, 21, -159, 87, -63], [-199, 21, -176]]

Ex Output:

[62, 85, 35, 82, -14, 14, 87, 21]