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:
[[-70, -63, 11, -65, -62], [41, -3, -20, -154, -13, 32, -116], [30, 90, -122, 12, 33], [72, -18, -151, -20, -177], [-85, 34, -87, 6, 20], [56, -153, -117, -101], [-59, 91, -123, -28, -60, -134], [-186, -162, -133]]

Ex Output:
[11, 41, 90, 72, 34, 56, 91, -133]


Ex Input:
[[-191, 34, 74, -110, -118, -35], [-128, 36, -145, 50, -127, 78, 43], [-166, -132], [-60, -144, -107, -52, -2, 63], [73, -89, -1, 35, -16], [-84, 39]]

Ex Output:
[74, 78, -132, 63, 73, 39]


Ex Input:
[[-143, -172, -69, -23, 44, -126], [-116, -41, -8, -6, -44, 54], [53, -14, -35, -100], [52, -45, 84], [-198, -71, 23, 96, -175, 30, -96], [-3, -129, -153, 94]]

Ex Output:

[44, 54, 53, 84, 96, 94]