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:
[[-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:
[[99, -189, -117, -151, 99, -174, 87], [-164, 68, -7, -84, 43, -199], [-62, -198, -32]]

Ex Output:
[99, 68, -32]


Ex Input:
[[-104, 46, 74, -172, -74], [-56, -65, 20, -124, -49, 44], [90, -134, -184, 94, 63, 52], [-23, -57, -107], [-86, -83, -55, -54, -135], [79, -170, -50]]

Ex Output:

[74, 44, 94, -23, -54, 79]