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:
[[-178, 31, -89, -67, 55, -105], [-18, 92, -9, 69, -95, 92], [-95, 45], [-127, 57], [41, -37, 33, 41], [-72, -74, -86, -183, 86, 31], [35, -121, -199], [-165, -69, 85, -172], [14, 85, -46, -140, 25]]

Ex Output:
[55, 92, 45, 57, 41, 86, 35, 85, 85]


Ex Input:
[[-43, 23, -190, -72], [-46, -165, -131, -63, -71, -180, -6], [55, -47, -79, -153, 76, -64, -110], [99, 48], [-144, -63], [-171, -108], [52, 66, -173, -101, -15, -136]]

Ex Output:

[23, -6, 76, 99, -63, -108, 66]