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:
[[-19, -31, -126], [-24, -137, -129], [-126, 93, -32, 79, -145, -152], [-200, -55], [-194, 52, -67, -77, 15, -186, -158], [92, 62, -44, 90, -168, 96, -193], [-22, -125]]

Ex Output:
[-19, -24, 93, -55, 52, 96, -22]


Ex Input:
[[96, -174], [-117, 48, -174, 19, -26, -7], [-151, 65, 16, -195], [19, 15], [-136, -26], [-118, -82, 95, 67], [-80, -160, -30, -94, -11, -55]]

Ex Output:
[96, 48, 65, 19, -26, 95, -11]


Ex Input:
[[-160, -172, -24, 6], [-198, -154, 8, -75], [-157, -79, 87, -123, -199, -128, -134], [-171, 10, -15, -65, 22, 23], [-172, 10, 100, 37], [-179, -62, -55, 12, 55], [-26, -182, -125, -196, -58, 20, 93], [31, -70, 23, -149, -65, -179]]

Ex Output:

[6, 8, 87, 23, 100, 55, 93, 31]