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:
[[-136, 45], [-57, 33], [-22, -147, -103, -96, 26], [69, -200], [-173, -190, 89, 86], [-27, -54, -152, -159, 10, 95], [-179, 47, 10, 57], [-95, -4, -108, -97, -131, -150, -119]]

Ex Output:
[45, 33, 26, 69, 89, 95, 57, -4]


Ex Input:
[[-119, -83, 95], [-198, 47, 25, -195, -159, -118], [66, -138, -98, -3, 65, -142], [8, 43, -166, 75], [-181, 33, -194, -82], [-31, -9, 38, -75, 72], [9, -187, -179]]

Ex Output:
[95, 47, 66, 75, 33, 72, 9]


Ex Input:
[[-159, -184], [54, -59, 64, -4, -62, 18], [55, -59, -1], [34, -131], [-148, 22, -82, -125, -172, -108], [-98, 79], [-87, -87, 66, -53, 18], [-163, -100, 99, 87, -99], [38, -32]]

Ex Output:

[-159, 64, 55, 34, 22, 79, 66, 99, 38]