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:
[[77, 41, -119, -94, -64], [-129, 98], [57, -199, -120, 23, 55, -62], [-76, 55, -37, -164, 95, 75, -120], [-149, -121, -123, -133, -136, 68]]

Ex Output:
[77, 98, 57, 95, 68]


Ex Input:
[[-77, 69], [35, -21, 65], [-182, -70], [-183, 51, -62, 34, -54, -137, 55], [46, -178, -122, -50, 32, -162, -132], [-9, -196, -1, -76, -36, 38]]

Ex Output:
[69, 65, -70, 55, 46, 38]


Ex Input:
[[-9, -168], [-36, -142], [49, 0, -128, -72, -83], [-170, 57, 74, -50, 1, 96, 96], [-114, -86, -69, -73, -29, -29, -178]]

Ex Output:

[-9, -36, 49, 96, -29]