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:
[[-167, 11, 40, 64], [-136, -48, -90, 19, -124], [54, -157, 3, -24, -62, -92, 84], [-67, -110, -11, -111, 40], [-147, 78, -58]]

Ex Output:
[64, 19, 84, 40, 78]


Ex Input:
[[-144, -147, -167, -134], [-136, -155, -95, 11, 3], [21, -157, -154, -85, -48, -42], [-22, 20, 86, 45], [-121, -74], [18, -1, -80, -98], [-96, -192, -106, 81, -44, -157], [92, -40], [79, -82, -172, -123, -164, -67, 46]]

Ex Output:
[-134, 11, 21, 86, -74, 18, 81, 92, 79]


Ex Input:
[[-42, -123], [31, 13, -187, -19, -8, -54], [-189, 52, -50, -86, 21, -80]]

Ex Output:

[-42, 31, 52]