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:
[[-20, -187], [-50, -191], [-69, -155, -10, -152, -72, 86], [53, -172, -84, 95]]

Ex Output:
[-20, -50, 86, 95]


Ex Input:
[[-108, -173, -55, -190], [-41, -89, -136, 96, -165, 57, 98], [-27, -150, -182, -32]]

Ex Output:
[-55, 98, -27]


Ex Input:
[[-87, 19, -140, -164, -74, 5, -179], [-3, -190, -176, -54, -89], [-157, 30, -82, -33, 52], [77, -161, 69, -99], [-133, -23, 93], [-15, -91, -162], [61, -173, -158, 99, 49, 63], [-155, -27, -28, -38, 68, 93]]

Ex Output:

[19, -3, 52, 77, 93, -15, 99, 93]