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, -79, 59, 63, -135, -96, -190], [-42, -144, -87, -33], [-109, -128, 25, 43, -50], [49, 68, -161, -180]]

Ex Output:
[63, -33, 43, 68]


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:
[[100, -44], [-123, -113, -69, -183, 62], [-160, 83, -58, 11, -116, 2, 81], [-125, -139, 57, 74, -164, -157]]

Ex Output:

[100, 62, 83, 74]