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:
[[-79, -105, 14, 41, -10, 26], [-96, -44, -191], [19, 34], [-56, -50, -39, -94, 79, 86], [-137, -145, -74, 26, -54, -172]]

Ex Output:
[41, -44, 34, 86, 26]


Ex Input:
[[-11, -151], [-190, -66, 69], [-25, -118, 63, 57, -157, -78, 79]]

Ex Output:
[-11, 69, 79]


Ex Input:
[[-59, -127, -142, -179], [-11, 59, -34, -102], [89, 71, -90], [13, 2, 36], [82, 7, -88], [-51, -106, -188, -136, 33], [-168, -84]]

Ex Output:

[-59, 59, 89, 36, 82, 33, -84]