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:
[[-124, -174, -30, -67], [44, -156, -76, 68, -145, -19, -178], [-18, -104, -19, -63, -15], [-99, 12, -129, 38, 4]]

Ex Output:
[-30, 68, -15, 38]


Ex Input:
[[61, -35, -161], [-87, 73], [-82, 78, -19, -170], [-169, -132, 71], [-99, -136, -127], [88, -173, 0, 74, -8, 73], [-111, -164, -30]]

Ex Output:
[61, 73, 78, 71, -99, 88, -30]


Ex Input:
[[-136, -164, -67, -110, -128, 70, 4], [10, -104, 57, 18, 39, 31], [21, -154], [-152, -15, -83, -140], [-39, 69, -67, -177, -13]]

Ex Output:

[70, 57, 21, -15, 69]